A concept-drifting detection algorithm for categorical evolving data

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In data streams analysis, detecting concept-drifting is a very important problem for real-time decision making. In this paper, we propose a new method for detecting concept drifts by measuring the difference of distributions between two concepts. The difference is defined by approximation accuracy of rough set theory, which can also be used to measure the change speed of concepts. We propose a concept-drifting detection algorithm and analyze its complexity. The experimental results on a real data set with a half million records have shown that the proposed algorithm is not only effective in discovering the changes of concepts but also efficient in processing large data sets. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Cao, F., & Huang, J. Z. (2013). A concept-drifting detection algorithm for categorical evolving data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7819 LNAI, pp. 485–496). https://doi.org/10.1007/978-3-642-37456-2_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free