A Self-Adaptive Framework for Concept Drift in Streaming Classification: Shadow-Model Pre-Training, Reliability-Weighted Detection and Scored Strategy Selection

In a data stream the relationship between inputs and labels can change without warning, which is known as concept drift. The usual remedy is to wait for a change detector to fire and then retrain the model from scratch, so accuracy drops first and recovers later. We describe a streaming framework that tries to avoid part of that cost. It starts training a shadow model as soon as a detector enters its warning state, combines the alarms of ADWIN, DDM and Page–Hinkley with weights learned online, describes each confirmed drift by its speed, severity, recurrence and the features that changed, and chooses an adaptation strategy by scoring candidate rules. The system reads from Apache Kafka and has a FastAPI dashboard. We compared it with seven baselines on four synthetic and two real streams (480 runs, of which the 160 runs on the real streams are replays of fixed data). The framework reached a mean accuracy of 90.82%, against 90.15% for a plain Hoeffding tree and 92.07% for Adaptive Random Forest (ARF), whose per-sample latency was 2.6 times higher in our setup. Its mean rank (2.83) was second only to ARF. A Friedman test found differences among the methods (p = 0.002), but a Nemenyi test separated only ARF from the plain and ADWIN-based trees. The framework is almost identical in accuracy to a proactive variant without weighted fusion, profiling or scored selection, and we have not yet run ablations, so our results do not show that those components improve accuracy. What the framework adds is a stored record of the rule scores behind every adaptation.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24270699
Primary Topic
Data Stream Mining Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Self-Adaptive Framework for Concept Drift in Streaming Classification: Shadow-Model Pre-Training, Reliability-Weighted Detection and Scored Strategy Selection

Ananya Patel G. P., Pooja M. V.
Zenodo (CERN European Organization for Nuclear Research)
Data Stream Mining Techniques
article

A Self-Adaptive Framework for Concept Drift in Streaming Classification: Shadow-Model Pre-Training, Reliability-Weighted Detection and Scored Strategy Selection

Ananya Patel G. P., Pooja M. V.
article en

Abstract

In a data stream the relationship between inputs and labels can change without warning, which is known as concept drift. The usual remedy is to wait for a change detector to fire and then retrain the model from scratch, so accuracy drops first and recovers later. We describe a streaming framework that tries to avoid part of that cost. It starts training a shadow model as soon as a detector enters its warning state, combines the alarms of ADWIN, DDM and Page–Hinkley with weights learned online, describes each confirmed drift by its speed, severity, recurrence and the features that changed, and chooses an adaptation strategy by scoring candidate rules. The system reads from Apache Kafka and has a FastAPI dashboard. We compared it with seven baselines on four synthetic and two real streams (480 runs, of which the 160 runs on the real streams are replays of fixed data). The framework reached a mean accuracy of 90.82%, against 90.15% for a plain Hoeffding tree and 92.07% for Adaptive Random Forest (ARF), whose per-sample latency was 2.6 times higher in our setup. Its mean rank (2.83) was second only to ARF. A Friedman test found differences among the methods (p = 0.002), but a Nemenyi test separated only ARF from the plain and ADWIN-based trees. The framework is almost identical in accuracy to a proactive variant without weighted fusion, profiling or scored selection, and we have not yet run ablations, so our results do not show that those components improve accuracy. What the framework adds is a stored record of the rule scores behind every adaptation.

Zenodo (CERN European Organization for Nuclear Research)
GM University Davanagere Karnataka (IN)
Data Stream Mining Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon