Efficient decision tree re-alignment for clustering time-changing data streams

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

Abstract

Mining streaming data has been an active research area to address requirements of applications, such as financial marketing, telecommunication, network monitoring, and so on. A popular technique for mining these continuous and fast-arriving data streams is decision trees. The accuracy of decision trees can deteriorate if the distribution of values in the stream changes over time. In this paper, we propose an approach based on decision trees that can detect distribution changes and re-align the decision tree quickly to reflect the change. The technique exploits a set of synopses on the leaf nodes, which are also used to prune the decision tree. Experimental results demonstrate that the proposed approach can detect the distribution changes in real-time with high accuracy, and re-aligning a decision tree can improve its performance in clustering the subsequent data stream tuples. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tao, Y., & Özsu, M. T. (2010). Efficient decision tree re-alignment for clustering time-changing data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6462 LNCS, pp. 20–43). https://doi.org/10.1007/978-3-642-17226-7_2

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