Journal of Shanghai Jiao Tong University ›› 2026, Vol. 60 ›› Issue (1): 112-122.doi: 10.16183/j.cnki.jsjtu.2024.198

• Electronic Information and Electrical Engineering • Previous Articles     Next Articles

Concept Drift Data Stream Classification Algorithm Based on Incremental Weighting

WU Yonghua1, MEI Ying2,3, LU Chengbo2,3()   

  1. 1 School of Computer Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China
    2 School of Mathematics and Computer, Lishui University, Lishui 323000, Zhejiang, China
    3 Zhejiang Detu Network Co., Ltd., Lishui 323000, Zhejiang, China
  • Received:2024-05-29 Revised:2024-08-26 Accepted:2024-09-04 Online:2026-01-28 Published:2026-01-27
  • Contact: LU Chengbo E-mail:lu.chengbo@aliyun.com.

Abstract:

Concept drift is one of the most common phenomena in data stream mining, where the underlying knowledge patterns in the data stream change dynamically over time, leading to a decline in the accuracy of previously established classifiers. To address this issue, we propose a concept drift data stream classification algorithm based on incremental weighting abbreviated as SCIW algorihtm. This algorithm employs a heuristic weight updating strategy combined with an adaptive method based on accuracy differences, and improves the Poisson distribution-based resampling strategy. The SCIW is capable of adapting to various concept drifts, effectively mitigating the decline in classifier accuracy. Experimental results on 14 synthetic datasets and 6 real-world datasets demonstrate that SCIW and adaptive random forests (ARF) outperform other algorithms in terms of accuracy. Additionally, SCIW significantly excels ARF in terms of time and memory consumption, with the overall average time consumption being approximately 83% of that of ARF and the overall average memory consumption being approximately 13% of that of ARF algorithm.

Key words: data stream, concept drift, classification algorithm, ensemble learning, adaptive

CLC Number: