Variance Feedback Drift Detection Method for Evolving Data Streams Mining
-
Published:2024-08-15
Issue:16
Volume:14
Page:7157
-
ISSN:2076-3417
-
Container-title:Applied Sciences
-
language:en
-
Short-container-title:Applied Sciences
Author:
Han Meng12, Meng Fanxing1, Li Chunpeng1
Affiliation:
1. School of Computer Science and Engineering, North Minzu University, Yinchuan 750021, China 2. The Key Laboratory of Images and Graphics Intelligent Processing of State Ethnic Affairs Commission: IGIPLab, North Minzu University, Yinchuan 750021, China
Abstract
Learning from changing data streams is one of the important tasks of data mining. The phenomenon of the underlying distribution of data streams changing over time is called concept drift. In classification decision-making, the occurrence of concept drift will greatly affect the classification efficiency of the original classifier, that is, the old decision-making model is not suitable for the new data environment. Therefore, dealing with concept drift from changing data streams is crucial to guarantee classifier performance. Currently, most concept drift detection methods apply the same detection strategy to different data streams, with little attention to the uniqueness of each data stream. This limits the adaptability of drift detectors to different environments. In our research, we designed a unique solution to address this issue. First, we proposed a variance estimation strategy and a variance feedback strategy to characterize the data stream’s characteristics through variance. Based on this variance, we developed personalized drift detection schemes for different data streams, thereby enhancing the adaptability of drift detection in various environments. We conducted experiments on data streams with various types of drifts. The experimental results show that our algorithm achieves the best average ranking for accuracy on the synthetic dataset, with an overall ranking 1.12 to 1.5 higher than the next-best algorithm. In comparison with algorithms using the same tests, our method improves the ranking by 3 to 3.5 for the Hoeffding test and by 1.12 to 2.25 for the McDiarmid test. In addition, they achieve a good balance between detection delay and false positive rates. Finally, our algorithm ranks higher than existing drift detection methods across the four key metrics of accuracy, CPU time, false positives, and detection delay, meeting our expectations.
Funder
National Natural Science Foundation of China Natural Science Foundation of Ningxia Province Central Universities Foundation of North Minzu University
Reference26 articles.
1. Perez, M., Somenzi, F., and Trivedi, A. (2024, January 18–22). A PAC learning algorithm for LTL and omega-regular objectives in MDPs. Proceedings of the AAAI Conference on Artificial Intelligence, Lexington, KY, USA. 2. Online and non-parametric drift detection methods based on Hoeffding’s bounds;IEEE Trans. Knowl. Data Eng.,2014 3. Gama, J., Medas, P., Castillo, G., and Rodrigues, P. (2004). Learning with drift detection. Advances in Artificial Intelligence–SBIA 2004: Proceedings of the 17th Brazilian Symposium on Artificial Intelligence, Sao Luis, Maranhao, Brazil, 29 September–1 Ocotber 2004, Springer. Proceedings 17. 4. Baena-Garcıa, M., del Campo-Ávila, J., Fidalgo, R., Bifet, A., Gavalda, R., and Morales-Bueno, R. (2006, January 20). Early drift detection method. Proceedings of the fourth international workshop on knowledge discovery from data streams, Philadelphia, PA, USA. 5. Bifet, A., and Gavalda, R. (2007, January 26–28). Learning from time-changing data with adaptive windowing. Proceedings of the 2007 SIAM International Conference on Data Mining: Society for Industrial and Applied Mathematics, Minneapolis, MN, USA.
|
|