DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift
원문 초록
When learning from streaming data, a change in the data distribution, also known as concept drift, can render a previously-learned model inaccurate and require training a new model. We present an adaptive learning algorithm that extends previous drift-detection-based methods by incorporating drift detection into a broader stable-state/reactive-state process. The advantage of our approach is that we can use aggressive drift detection in the stable state to achieve a high detection rate, but mitigate the false positive rate of standalone drift detection via a reactive state that reacts quickly to true drifts while eliminating most false positives. The algorithm is generic in its base learner and can be applied across a variety of supervised learning problems. Our theoretical analysis shows that the risk of the algorithm is competitive to an algorithm with oracle knowledge of when (abrupt) drifts occur. Experiments on synthetic and real datasets with concept drifts confirm our theoretical analysis.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lite-RVFL: A Lightweight Random Vector Functional-Link Neural Network for Learning Under Concept Drift
Describing Nonstationary Data Streams in Frequency Domain
Early Concept Drift Detection via Prediction Uncertainty
Structuring the Processing Frameworks for Data Stream Evaluation and Application
SUDS: A Strategy for Unsupervised Drift Sampling
A method to benchmark high-dimensional process drift detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.