Cited by 3,735Data Stream Mining TechniquesDomain Adaptation and Few-Shot LearningAdvanced Bandit Algorithms Research

The DOI matches its Crossref record; 165 of the 171 references it cites were found in a registry or an index.

A survey on concept drift adaptation

Open access

Abstract

Concept drift primarily refers to an online supervised learning scenario when the relation between the input data and the target variable changes over time. Assuming a general knowledge of supervised learning in this article, we characterize adaptive learning processes; categorize existing strategies for handling concept drift; overview the most representative, distinct, and popular techniques and algorithms; discuss evaluation methodology of adaptive algorithms; and present a set of illustrative applications. The survey covers the different facets of concept drift in an integrated way to reflect on the existing scattered state of the art. Thus, it aims at providing a comprehensive introduction to the concept drift adaptation for researchers, industry analysts, and practitioners.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2523813

Cites

165 of 165 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Show all 171 references

6 of the 171 references couldn’t be matched to a known paper.

Research works printed but not linked: 9

  1. 10.1002/sam.v2:5/6 · DOI
  2. 10.5555/647458.728399 · DOI
  3. 10.5555/1662648.1662650 · DOI
  4. 10.5555/1293846.1293848 · DOI
  5. 10.5555/3120828.3120894 · DOI
  6. 10.1002/rob.v23:9 · DOI
  7. A. Wald . 1947. Sequential Analysis . John Wiley and Sons . A. Wald. 1947. Sequential Analysis. John Wiley and Sons.
  8. 10.5555/2010989.2010997 · DOI
  9. 10.5555/2050236.2050265 · DOI

Cited by

Sorted by citations

Items 601–700 of 1,007

Metadata

Authors
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A.
Affiliations
  • Universidade do Porto (PT)
  • Helsinki Institute for Information Technology (FI)
  • Yahoo (Spain) (ES)
  • Eindhoven University of Technology (NL)
  • Bournemouth University (GB)
Venue
ACM Computing Surveys
Published
2014-03
Volume
46
Issue
4
Pages
1-37
ISSN
  • 0360-0300 (ISSN-L)
  • 1557-7341
OpenAlex
W2099419573
Cited by
3,735
References
171
Citations by year
2026: 688 · 2025: 435 · 2024: 296 · 2023: 345 · 2022: 306 · 2021: 367 · 2020: 327 · 2019: 281 · 2018: 229 · 2017: 197 · 2016: 137 · 2015: 96 · 2014: 27
FWCI
151.70
Type
journal article
Language
en
Locations
  • ACM Computing Surveys (publishedVersion)
  • TU/e Research Portal (publishedVersion)
  • Bournemouth University Research Online (Bournemouth University) (submittedVersion)
  • Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) (submittedVersion, other-oa)
  • TU/e Research Portal (submittedVersion)
Funders
  • Seventh Framework Programme (251617, ICT-2013-612944)
  • Fundação para a Ciência e a Tecnologia
  • COMPETE Program
  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek
  • Suomen Akatemia (118653)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Data Stream Mining Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
concept drift, online supervised learning, adaptive learning, adaptive algorithms, algorithm evaluation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review