pith. sign in

arxiv: 2606.20216 · v1 · pith:7GNIVFX4new · submitted 2026-06-18 · 💻 cs.LG · cs.AI

Learner-based Concept Drift Detection: Analysis and Evaluation

Md Moman Ul Haque Khan , Samira Sadaoui This is my paper

Pith reviewed 2026-06-26 17:59 UTC · model grok-4.3

classification 💻 cs.LG cs.AI
keywords concept driftdrift detectionstreaming datamachine learningevaluationnon-stationary datalearner-based methods
0
0 comments X

The pith

Concept drift detectors show varying effectiveness for abrupt versus gradual changes in streaming data.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper analyzes concept drift in machine learning systems that process evolving data streams and evaluates multiple learner-based detection algorithms. It reviews the theoretical properties of concept drift and tests the algorithms on both synthetic and real-world datasets that include abrupt and gradual drift patterns. The evaluation aims to clarify how different detectors behave and in which streaming contexts they remain useful. Accurate and timely drift detection is presented as essential for preserving model accuracy when data distributions shift over time. The work covers several categories of detectors to map their strengths across diverse scenarios.

Core claim

This study examines theoretically the concept drift characteristics and numerous drift detection algorithms across several categories. Furthermore, we evaluate their performance on both synthetic and real-world datasets exhibiting diverse streaming scenarios and drift characteristics, such as abrupt and gradual changes. This study aims to enhance understanding of the complex notion of concept drift characteristics and behavior of drift detectors, along with their applicability to diverse contexts.

What carries the argument

Learner-based concept drift detectors that monitor changes in data distributions to identify when the underlying concept has drifted.

If this is right

  • Timely drift detection sustains predictive accuracy in non-stationary environments.
  • Detectors can be matched to specific drift types such as abrupt or gradual based on observed performance.
  • Evaluation across multiple categories clarifies which algorithms suit particular application contexts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Standardized test suites with controlled drift parameters would allow more precise comparison of new detectors.
  • Hybrid approaches that combine detectors from different categories might cover a wider range of drift behaviors.
  • Real-time monitoring of detector output statistics could provide early warnings even before explicit drift labels are available.

Load-bearing premise

The selected synthetic and real-world datasets and the categories of drift detection algorithms examined are representative enough to draw general conclusions about their performance across all possible streaming scenarios.

What would settle it

A new streaming dataset containing drift types or frequencies outside the study's tested scenarios where the relative performance rankings of the detectors reverse or become uniform.

read the original abstract

Machine learning algorithms deployed for evolving streaming environments must handle the non-stationary data distributions, commonly referred to as concept drift. The presence of concept drift poses a major challenge for many real-world applications because it can severely degrade their predictive performance, hindering their ability to support robust decision-making. Consequently, the timely and efficient detection of drift events is critical for sustaining high accuracy over time. This study examines theoretically the concept drift characteristics and numerous drift detection algorithms across several categories. Furthermore, we evaluate their performance on both synthetic and real-world datasets exhibiting diverse streaming scenarios and drift characteristics, such as abrupt and gradual changes. This study aims to enhance understanding of the complex notion of concept drift characteristics and behavior of drift detectors, along with their applicability to diverse contexts.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript theoretically examines concept drift characteristics and drift detection algorithms across several categories. It evaluates their performance on synthetic and real-world datasets exhibiting abrupt and gradual drift, with the aim of enhancing understanding of drift behavior and detector applicability to diverse streaming contexts.

Significance. If the evaluation is comprehensive and the datasets representative, the work could offer useful comparative insights for selecting drift detectors in non-stationary environments, combining theory with benchmarks on both controlled and practical data. The dual approach is a strength.

major comments (1)
  1. [Abstract] Abstract: the claim of applicability to 'diverse contexts' is load-bearing for the paper's contribution but rests on unexamined representativeness of the chosen datasets and algorithm categories; the text only references abrupt and gradual changes with no discussion of coverage for recurring, incremental, or other regimes.
minor comments (1)
  1. The abstract would be clearer if it named the specific algorithm categories and the number of datasets used.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback on the abstract. We address the major comment below and agree that revisions are needed to align the claims with the manuscript's scope.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim of applicability to 'diverse contexts' is load-bearing for the paper's contribution but rests on unexamined representativeness of the chosen datasets and algorithm categories; the text only references abrupt and gradual changes with no discussion of coverage for recurring, incremental, or other regimes.

    Authors: We agree that the abstract's phrasing regarding 'diverse contexts' and 'diverse streaming scenarios' is broader than the explicit analysis provided. The evaluations center on abrupt and gradual drifts using standard synthetic and real-world benchmarks, with algorithm categories selected from common literature. While the manuscript discusses dataset characteristics and detector performance in those regimes, it does not examine or claim coverage for recurring, incremental, or other drift types, nor does it include a dedicated analysis of representativeness across all possible regimes. We will revise the abstract to remove or qualify the 'diverse contexts' claim, specify the focus on abrupt and gradual changes, and add a clarifying statement on scope in the introduction. revision: yes

Circularity Check

0 steps flagged

No significant circularity; empirical evaluation on external data

full rationale

The paper performs a theoretical examination of concept drift characteristics and an empirical performance evaluation of drift detectors on external synthetic and real-world datasets. No mathematical derivations, parameter fitting presented as predictions, self-citation load-bearing premises, or ansatz smuggling are present. All claims rest on independent external benchmarks rather than reducing to the paper's own inputs by construction, satisfying the criteria for a self-contained empirical study.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no free parameters, axioms, or invented entities are specified or invoked in the provided text.

pith-pipeline@v0.9.1-grok · 5650 in / 972 out tokens · 19978 ms · 2026-06-26T17:59:51.381603+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

61 extracted references · 22 canonical work pages

  1. [1]

    Roadmap of Concept Drift Adaptation in Data Stream Mining, Years Later

    Osama A.Mehdi et al. “Roadmap of Concept Drift Adaptation in Data Stream Mining, Years Later”. In:IEEE AccessPP (Jan. 2024), pp. 1–1.doi:10.1109/ ACCESS.2024.3358817

    arXiv 2024

  2. [2]

    An Overview on Concept Drift Learn- ing

    Joao Paulo Papa Adriana Sayuri Iwashita. “An Overview on Concept Drift Learn- ing”. In:IEEE Access(2019)

    2019

  3. [3]

    Concept Drift Detection in Data Stream Mining : A literature review

    Supriya Agrahari and Anil Kumar Singh. “Concept Drift Detection in Data Stream Mining : A literature review”. In:Journal of King Saud University - Computer and Information Sciences34.10, Part B (2022), pp. 9523–9540.issn: 1319-1578.doi: https : / / doi . org / 10 . 1016 / j . jksuci . 2021 . 11 . 006.url:https : / / www . sciencedirect.com/science/article...

    2022

  4. [4]

    A survey on learning from imbalanced data streams: taxonomy, challenges, empirical study, and reproducible experimental framework

    Gabriel Aguiar, Bartosz Krawczyk, and Alberto Cano. “A survey on learning from imbalanced data streams: taxonomy, challenges, empirical study, and reproducible experimental framework”. In:Machine Learning113 (June 2023), pp. 1–79.doi: 10.1007/s10994-023-06353-6

    work page doi:10.1007/s10994-023-06353-6 2023

  5. [5]

    Early drift detection method

    M. Baena-Garcıa et al. “Early drift detection method”. In:International Workshop on Knowledge Discovery from Data Streams(2006)

    2006

  6. [6]

    A large-scale comparison of concept drift detectors

    R. S. M. Barros and S. G. T. C. Santos. “A large-scale comparison of concept drift detectors”. In:Information Sciences451-452 (2018), pp. 348–370.issn: 0020- 0255.doi:https : / / doi . org / 10 . 1016 / j . ins . 2018 . 04 . 014.url:https : //www.sciencedirect.com/science/article/pii/S0020025518302743

    2018

  7. [7]

    Wilcoxon Rank Sum Test Drift Detector

    Roberto Barros, Juan Gonzalez Hidalgo, and Danilo Cabral. “Wilcoxon Rank Sum Test Drift Detector”. In:Neurocomputing275 (Jan. 2018), pp. 1954–1963.doi: 10.1016/j.neucom.2017.10.051

    work page doi:10.1016/j.neucom.2017.10.051 2018

  8. [8]

    An Overview and Comprehensive Comparison of Ensembles for Concept Drift

    Roberto Barros and Silas Santos. “An Overview and Comprehensive Comparison of Ensembles for Concept Drift”. In:Information Fusion52 (Dec. 2019), pp. 213– 244.doi:10.1016/j.inffus.2019.03.006

    work page doi:10.1016/j.inffus.2019.03.006 2019

  9. [9]

    Expert Sys- tems with Applications83, 187–205 (2017) https://doi.org/10.1016/j.eswa.2017

    Roberto Barros et al. “RDDM: Reactive drift detection method”. In:Expert Sys- tems with Applications90 (Dec. 2017), pp. 344–355.doi:10.1016/j.eswa.2017. 08.023

    work page doi:10.1016/j.eswa.2017 2017

  10. [10]

    Improving Fraud Detection and Concept Drift Adaptation in Credit Card Transactions Using Incremental Gradient Boosting Trees

    Barı¸ s Bayram, Bilge K¨ oro˘ glu, and Mehmet G¨ onen. “Improving Fraud Detection and Concept Drift Adaptation in Credit Card Transactions Using Incremental Gradient Boosting Trees”. In:2020 19th IEEE International Conference on Ma- chine Learning and Applications (ICMLA). 2020, pp. 545–550.doi:10 . 1109 / ICMLA51294.2020.00091. 24

    arXiv 2020

  11. [11]

    Version V1

    Alessio Bernardo.Artificial and Real dataset with different concept drift type and imbalance ratio. Version V1. 2020.doi:10.7910/DVN/RKY6RD.url:https:// doi.org/10.7910/DVN/RKY6RD

    work page doi:10.7910/dvn/rky6rd.url:https:// 2020

  12. [12]

    Learning from Time-Changing Data with Adaptive Windowing

    A. Bifet and R. Gavalda. “Learning from Time-Changing Data with Adaptive Windowing”. In:SDM(2007)

    2007

  13. [13]

    Accuracy Updated Ensemble for Data Streams with Concept Drift

    D. Brzezinski and J. Stefanowski. “Accuracy Updated Ensemble for Data Streams with Concept Drift”. In: vol. 6679. May 2011, pp. 155–163.isbn: 978-3-642-21221- 5.doi:10.1007/978-3-642-21222-2_19

    work page doi:10.1007/978-3-642-21222-2_19 2011

  14. [14]

    Concept drift detection based on Fisher’s Exact test

    D. R. L. Cabral and R. S. M. Barros. “Concept drift detection based on Fisher’s Exact test”. In:Information Sciences442-443 (2018), pp. 220–234.issn: 0020- 0255.doi:https : / / doi . org / 10 . 1016 / j . ins . 2018 . 02 . 054.url:https : //www.sciencedirect.com/science/article/pii/S0020025518301403

    2018

  15. [15]

    From concept drift to model degradation: An overview on performance-aware drift detectors

    Andreas Kassler Firas Bayram Bestoun S. Ahmed. “From concept drift to model degradation: An overview on performance-aware drift detectors”. In:Knowledge- Based Systems(2022)

    2022

  16. [16]

    On the Interpretation of X2 from Contingency Tables, and the Calculation of P

    R. A. Fisher. “On the Interpretation of X2 from Contingency Tables, and the Calculation of P”. In:Journal of the Royal Statistical Society85.1 (1922), pp. 87– 94.issn: 09528385.url:http://www.jstor.org/stable/2340521(visited on 11/12/2024)

    arXiv 1922

  17. [17]

    A Survey on Concept Drift Adaptation

    J. Gama et al. “A Survey on Concept Drift Adaptation”. In:ACM Computing Surveys (CSUR)(2014)

    2014

  18. [18]

    Learning with Drift Detection

    J. Gama et al. “Learning with Drift Detection”. In:Intelligent Data Analysis (2004)

    2004

  19. [19]

    Correction to: Adaptive random forests for evolving data stream classification

    Heitor M. Gomes et al. “Correction to: Adaptive random forests for evolving data stream classification”. In:Mach. Learn.108.10 (Oct. 2019), pp. 1877–1878.issn: 0885-6125.doi:10.1007/s10994- 019- 05793- 3.url:https://doi.org/10. 1007/s10994-019-05793-3

    work page doi:10.1007/s10994- 2019

  20. [20]

    Unsupervised Concept Drift Detection with a Discrimina- tive Classifier

    ¨Omer G¨ oz¨ ua¸ cik et al. “Unsupervised Concept Drift Detection with a Discrimina- tive Classifier”. In:Proceedings of the 28th ACM International Conference on In- formation and Knowledge Management(2019).url:https://api.semanticscholar. org/CorpusID:207757814

    2019

  21. [21]

    Concept learning using one-class classifiers for implicit drift detection in evolving data streams

    ¨Omer G¨ oz¨ ua¸ cık and Fazli Can. “Concept learning using one-class classifiers for implicit drift detection in evolving data streams”. In:Artif. Intell. Rev.54.5 (June 2021), pp. 3725–3747.issn: 0269-2821.doi:10.1007/s10462-020-09939-x.url: https://doi.org/10.1007/s10462-020-09939-x

    work page doi:10.1007/s10462-020-09939-x.url: 2021

  22. [22]

    Unsupervised concept drift detection for multi-label data streams

    Ege Gulcan and Fazli Can. “Unsupervised concept drift detection for multi-label data streams”. In:Artificial Intelligence Review56 (July 2022).doi:10.1007/ s10462-022-10232-2. 25

    2022

  23. [23]

    A survey of active and passive concept drift handling methods

    Meng Han et al. “A survey of active and passive concept drift handling methods”. In:Computational Intelligence38.4 (2022), pp. 1492–1535.doi:https://doi. org/10.1111/coin.12520. eprint:https://onlinelibrary.wiley.com/doi/ pdf/10.1111/coin.12520.url:https://onlinelibrary.wiley.com/doi/abs/ 10.1111/coin.12520

    work page doi:10.1111/coin.12520 2022

  24. [24]

    No Free Lunch Theorem for concept drift detection in streaming data classification: A review

    Tegjyot S. Sethi Hanqing Hu Mehmed Kantardzic. “No Free Lunch Theorem for concept drift detection in streaming data classification: A review”. In:Wiley In- terdisciplinary Reviews: Data Mining and Knowledge Discovery(2019)

    2019

  25. [25]

    Fabian Hinder, Valerie Vaquet, and Barbara Hammer.One or Two Things We know about Concept Drift – A Survey on Monitoring Evolving Environments. 2023. arXiv:2310.15826 [cs.LG].url:https://arxiv.org/abs/2310.15826

    arXiv 2023

  26. [26]

    Probability Inequalities for Sums of Bounded Random Vari- ables

    Wassily Hoeffding. “Probability Inequalities for Sums of Bounded Random Vari- ables”. In:Journal of the American Statistical Association58.301 (1963), pp. 13– 30.issn: 01621459, 1537274X.url:http://www.jstor.org/stable/2282952 (visited on 10/22/2024)

    arXiv 1963

  27. [27]

    Discussion and review on evolving data streams and concept drift adapting

    M. Hammami I. Khamassi M. Sayed-Mouchaweh and K. Gh´ edira. “Discussion and review on evolving data streams and concept drift adapting”. In:Evolving Systems (2018)

    2018

  28. [28]

    A K-Means clustering and SVM based hybrid concept drift detection technique for network anomaly detec- tion

    Meenal Jain, Gagandeep Kaur, and Vikas Saxena. “A K-Means clustering and SVM based hybrid concept drift detection technique for network anomaly detec- tion”. In:Expert Systems with Applications193 (2022), p. 116510.issn: 0957- 4174.doi:https : / / doi . org / 10 . 1016 / j . eswa . 2022 . 116510.url:https : //www.sciencedirect.com/science/article/pii/S095...

    2022

  29. [29]

    Dynamic Ensemble Selection for Imbalanced Data Streams With Concept Drift

    Botao Jiao et al. “Dynamic Ensemble Selection for Imbalanced Data Streams With Concept Drift”. In:IEEE Transactions on Neural Networks and Learning Systems 35.1 (2024), pp. 1278–1291.doi:10.1109/TNNLS.2022.3183120

    work page doi:10.1109/tnnls.2022.3183120 2024

  30. [30]

    Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts

    J. Zico Kolter and Marcus A. Maloof. “Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts”. In:J. Mach. Learn. Res.8 (Dec. 2007), pp. 2755– 2790.issn: 1532-4435

    2007

  31. [31]

    Ensemble learning for data stream analysis: A survey

    Bartosz Krawczyk et al. “Ensemble learning for data stream analysis: A survey”. In:Information Fusion37 (2017), pp. 132–156.issn: 1566-2535.doi:https:// doi.org/10.1016/j.inffus.2017.02.004.url:https://www.sciencedirect. com/science/article/pii/S1566253516302329

    work page doi:10.1016/j.inffus.2017.02.004.url:https://www.sciencedirect 2017

  32. [32]

    Information and Computation , author =

    N. Littlestone and M.K. Warmuth. “The Weighted Majority Algorithm”. In:Infor- mation and Computation108.2 (1994), pp. 212–261.issn: 0890-5401.doi:https: //doi.org/10.1006/inco.1994.1009.url:https://www.sciencedirect.com/ science/article/pii/S0890540184710091

    work page doi:10.1006/inco.1994.1009.url:https://www.sciencedirect.com/ 1994

  33. [33]

    Harvard Dataverse

    Jes´ us L´ opez Lobo.Synthetic datasets for concept drift detection purposes.url: https://doi.org/10.7910/DVN/5OWRGB. Harvard Dataverse. 26

    work page doi:10.7910/dvn/5owrgb

  34. [34]

    Data-driven decision support under concept drift in streamed big data

    Jie Lu et al. “Data-driven decision support under concept drift in streamed big data”. In:Complex and Intelligent Systems6 (2020).doi:10.1007/s40747-019- 00124-4

    work page doi:10.1007/s40747-019- 2020

  35. [35]

    Learning under Concept Drift: A Review

    Jie Lu et al. “Learning under Concept Drift: A Review”. In:IEEE Transactions on Knowledge and Data Engineering31.12 (2019), pp. 2346–2363.doi:10.1109/ TKDE.2018.2876857

    arXiv 2019

  36. [36]

    An adaptive profile based fraud detection framework for handling concept drift

    Donia Malekian and Mahmoud Reza Hashemi. “An adaptive profile based fraud detection framework for handling concept drift”. In:2013 10th International ISC Conference on Information Security and Cryptology (ISCISC). 2013, pp. 1–6.doi: 10.1109/ISCISC.2013.6767338

    work page doi:10.1109/iscisc.2013.6767338 2013

  37. [37]

    Surveys in Combinatorics, 1989: On the method of bounded differences

    Colin McDiarmid. “Surveys in Combinatorics, 1989: On the method of bounded differences”. In: 1989.url:https : / / api . semanticscholar . org / CorpusID : 116663483

    1989

  38. [38]

    Concept Drift Adaptation Techniques in Distributed Environment for Real-World Data Streams

    Hassan Mehmood et al. “Concept Drift Adaptation Techniques in Distributed Environment for Real-World Data Streams”. In:Smart Cities(2021).url:https: //api.semanticscholar.org/CorpusID:233623878

    2021

  39. [39]

    Detecting Concept Drift Using Statistical Testing

    K. Nishida and K. Yamauchi. “Detecting Concept Drift Using Statistical Testing”. In:Discovery Science, 10th International Conference, DS 2007(2007)

    2007

  40. [40]

    Concept Drift Detection Based on Typicality and Eccentricity

    Yuri Thomas P. Nunes and Luiz Affonso Guedes. “Concept Drift Detection Based on Typicality and Eccentricity”. In:IEEE Access12 (2024), pp. 13795–13808.doi: 10.1109/ACCESS.2024.3355959

    work page doi:10.1109/access.2024.3355959 2024

  41. [41]

    A Novel Probabilistic Approach for Detect- ing Concept Drift in Streaming Data

    Sirvan Parasteh and Samira Sadaoui. “A Novel Probabilistic Approach for Detect- ing Concept Drift in Streaming Data”. In:Deep Learning Theory and Applications. Ed. by Donatello Conte et al. Cham: Springer Nature Switzerland, 2023, pp. 173– 188.isbn: 978-3-031-39059-3

    2023

  42. [42]

    A Probabilistic Approach for Detecting Real Concept Drift

    Sirvan Parasteh and Samira Sadaoui. “A Probabilistic Approach for Detecting Real Concept Drift.” In:Proc. of 16th International Conference on Agents and Artificial Intelligence-Volume 2, ICAART (2). 2024, pp. 301–311

    2024

  43. [43]

    A Robust Probabilistic Framework for Iden- tifying and Evaluating Concept Drift in Abrupt and Gradual Scenarios

    Sirvan Parasteh and Samira Sadaoui. “A Robust Probabilistic Framework for Iden- tifying and Evaluating Concept Drift in Abrupt and Gradual Scenarios”. In:Agents and Artificial Intelligence. Ed. by Ana Paula Rocha, Luc Steels, and Jaap van den Herik. Springer Nature, 2025, pp. 353–367

    2025

  44. [44]

    Detection of Real Concept Drift Under Noisy Data Stream

    Sirvan Parasteh, Samira Sadaoui, and Mohammad Sadegh Khosravani. “Detection of Real Concept Drift Under Noisy Data Stream”. In:2023 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE. 2023, pp. 1316–1321

    2023

  45. [45]

    Pesaranghader, H

    A. Pesaranghader, H. Viktor, and E. Paquet.McDiarmid Drift Detection Methods for Evolving Data Streams. 2018. arXiv:1710.02030 [stat.ML]. 27

    Pith/arXiv arXiv 2018

  46. [46]

    Fast Hoeffding Drift Detection Method for Evolving Data Streams

    Ali Pesaranghader and Herna L. Viktor. “Fast Hoeffding Drift Detection Method for Evolving Data Streams”. In:Machine Learning and Knowledge Discovery in Databases. Cham: Springer International Publishing, 2016, pp. 96–111.isbn: 978- 3-319-46227-1

    2016

  47. [47]

    Reactive Soft Prototype Computing for Concept Drift Streams

    C. Raab, M. Heusinger, and F. Schleif. “Reactive Soft Prototype Computing for Concept Drift Streams”. In:Neurocomputing(2020)

    2020

  48. [48]

    Exponentially weighted moving average charts for detecting concept drift

    Gordon J. Ross et al. “Exponentially weighted moving average charts for detecting concept drift”. In:Pattern Recognition Letters33.2 (2012), pp. 191–198.issn: 0167- 8655.doi:https://doi.org/10.1016/j.patrec.2011.08.019

    work page doi:10.1016/j.patrec.2011.08.019 2012

  49. [49]

    Chunk-based incremental feature learn- ing for credit-card fraud data stream

    Armin Sadreddin and Samira Sadaoui. “Chunk-based incremental feature learn- ing for credit-card fraud data stream”. In:Journal of Experimental & Theoretical Artificial Intelligence(2022), pp. 1–19.doi:10.1080/0952813X.2022.2153277. url:https://doi.org/10.1080/0952813X.2022.2153277

    work page doi:10.1080/0952813x.2022.2153277 2022

  50. [50]

    Learning From Network Data Changes for Unsupervised Botnet Detection

    Bruno Henrique Schwengber et al. “Learning From Network Data Changes for Unsupervised Botnet Detection”. In:IEEE Transactions on Network and Service Management19.1 (2022), pp. 601–613.doi:10.1109/TNSM.2021.3109076

    work page doi:10.1109/tnsm.2021.3109076 2022

  51. [51]

    Data stream mining: methods and chal- lenges for handling concept drift

    Eyad Elyan Scott Wares John Isaacs. “Data stream mining: methods and chal- lenges for handling concept drift”. In:SN Applied Sciences(2019)

    2019

  52. [52]

    Toward Gener- ating a New Intrusion Detection Dataset and Intrusion Traffic Characterization

    Iman Sharafaldin, Arash Habibi Lashkari, and Ali A. Ghorbani. “Toward Gener- ating a New Intrusion Detection Dataset and Intrusion Traffic Characterization”. In:International Conference on Information Systems Security and Privacy. 2018. url:https://api.semanticscholar.org/CorpusID:4707749

    2018

  53. [53]

    A survey on machine learning for recurring concept drifting data streams

    Andr´ es L. Su´ arez-Cetrulo, David Quintana, and Alejandro Cervantes. “A survey on machine learning for recurring concept drifting data streams”. In:Expert Systems with Applications213 (2023), p. 118934.issn: 0957-4174.doi:https : / / doi . org/10.1016/j.eswa.2022.118934.url:https://www.sciencedirect.com/ science/article/pii/S0957417422019522

    work page doi:10.1016/j.eswa.2022.118934.url:https://www.sciencedirect.com/ 2023

  54. [54]

    Learning from streaming data with concept drift and imbalance: an overview

    N.V. Chawla T.R. Hoens R. Polikar. “Learning from streaming data with concept drift and imbalance: an overview”. In:Progress in Artificial Intelligence(2012)

    2012

  55. [55]

    Anomalies Detection Using Isolation in Concept- Drifting Data Streams

    Maurras Ulbricht Togbe et al. “Anomalies Detection Using Isolation in Concept- Drifting Data Streams”. In:Computers10.1 (2021).issn: 2073-431X.doi:10 . 3390/computers10010013.url:https://www.mdpi.com/2073-431X/10/1/13

    2021

  56. [56]

    Mining Concept-Drifting Data Streams Using Ensemble Classi- fiers

    H. Wang et al. “Mining Concept-Drifting Data Streams Using Ensemble Classi- fiers”. In: (July 2003).doi:10.1145/956750.956778

    work page doi:10.1145/956750.956778 2003

  57. [57]

    Understanding Concept Drift

    Geoffrey I. Webb et al. “Understanding Concept Drift”. In:ArXiv(2017)

    2017

  58. [58]

    Individual Comparisons by Ranking Methods

    Frank Wilcoxon. “Individual Comparisons by Ranking Methods”. In:Biometrics Bulletin1.6 (1945), pp. 80–83.issn: 00994987.url:http://www.jstor.org/ stable/3001968(visited on 10/28/2024). 28

    arXiv 1945

  59. [59]

    Concept Drift Adaptation Methods under the Deep Learning Framework: A Literature Review

    Q. Xiang et al. “Concept Drift Adaptation Methods under the Deep Learning Framework: A Literature Review”. In:Applied Sciences13 (May 2023), p. 6515. doi:10.3390/app13116515

    work page doi:10.3390/app13116515 2023

  60. [60]

    Online and Unsupervised Anomaly De- tection for Streaming Data Using an Array of Sliding Windows and PDDs

    Lingyu Zhang, Jiabao Zhao, and Wei Li. “Online and Unsupervised Anomaly De- tection for Streaming Data Using an Array of Sliding Windows and PDDs”. In: IEEE Transactions on Cybernetics51.4 (2021), pp. 2284–2289.doi:10 . 1109 / TCYB.2019.2935066

    arXiv 2021

  61. [61]

    Learning under Concept Drift: an Overview

    Indre ˇZliobaite. “Learning under Concept Drift: an Overview”. In:ArXiv(2010). 29

    2010