An efficient and sensitive decision tree approach to mining concept-drifting data streams

10Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data block is basically a random sample from a stationary distribution, but many databases available violate this assumption. That is, the class of an instance may change over time, known as concept drift. In this paper, we propose a Sensitive Concept Drift Probing Decision Tree algorithm (SCRIPT), which is based on the statistical X2 test, to handle the concept drift problem on data streams. Compared with the proposed methods, the advantages of SCRIPT include: a) it can avoid unnecessary system cost for stable data streams; b) it can immediately and efficiently corrects original classifier while data streams are instable; c) it is more suitable to the applications in which a sensitive detection of concept drift is required. © 2008 Institute of Mathematics and Informatics.

Cite

CITATION STYLE

APA

Tsai, C. J., Lee, C. I., & Yang, W. P. (2008). An efficient and sensitive decision tree approach to mining concept-drifting data streams. Informatica, 19(1), 135–156. https://doi.org/10.15388/informatica.2008.206

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