# A Neighbor-Searching Discrepancy-based Drift Detection Scheme for Learning Evolving Data

arXiv: https://arxiv.org/abs/2405.14153 · HTML: https://mlsanity.com/paper/2405.14153/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 6 of its 48 references that are in the map.
- First posted on arXiv 23 May 2024.

## Builds on (most cited first, 6 of 6)

- [Learning under Concept Drift: A Review](https://mlsanity.com/paper/2004.05785/) (2020)
- [River: machine learning for streaming data in Python](https://mlsanity.com/paper/2012.04740/) (2020)
- [AMF: Aggregated Mondrian Forests for Online Learning](https://mlsanity.com/paper/1906.10529/) (2019)
- [Request-and-Reverify: Hierarchical Hypothesis Testing for Concept Drift Detection with Expensive Labels](https://mlsanity.com/paper/1806.10131/) (2018)
- [Concept Drift Detection via Equal Intensity k-means Space Partitioning](https://mlsanity.com/paper/2004.11587/) (2020)
- [Online Tool Condition Monitoring Based on Parsimonious Ensemble+](https://mlsanity.com/paper/1711.01843/) (2017)

## Built on by (most cited first, 1 of 1)

- [Holistic Continual Learning under Concept Drift with Adaptive Memory Realignment](https://mlsanity.com/paper/2507.02310/) (2025)

## Abstract (arXiv)

Uncertain changes in data streams present challenges for machine learning models to dynamically adapt and uphold performance in real-time. Particularly, classification boundary change, also known as real concept drift, is the major cause of classification performance deterioration. However, accurately detecting real concept drift remains challenging because the theoretical foundations of existing drift detection methods - two-sample distribution tests and monitoring classification error rate, both suffer from inherent limitations such as the inability to distinguish virtual drift (changes not affecting the classification boundary, will introduce unnecessary model maintenance), limited statistical power, or high computational cost. Furthermore, no existing detection method can provide information on the trend of the drift, which could be invaluable for model maintenance. This work presents a novel real concept drift detection method based on Neighbor-Searching Discrepancy, a new statistic that measures the classification boundary difference between two samples. The proposed method is able to detect real concept drift with high accuracy while ignoring virtual drift. It can also indicate the direction of the classification boundary change by identifying the invasion or retreat of a certain class, which is also an indicator of separability change between classes. A comprehensive evaluation of 11 experiments is conducted, including empirical verification of the proposed theory using artificial datasets, and experimental comparisons with commonly used drift handling methods on real-world datasets. The results show that the proposed theory is robust against a range of distributions and dimensions, and the drift detection method outperforms state-of-the-art alternative methods.