IEEE Transactions on Knowledge and Data Engineering · 2013 · 154 citations · 21 references
ComputingComputer ScienceDecision SciencesAlgorithmsData MiningDecision Support SystemsDecision TreesStreaming AlgorithmsData Stream MiningStream MiningStream PartitioningStreaming Data Mining
Since the Hoeffding tree algorithm was proposed in the literature, decision trees became one of the most popular tools for mining data streams. The key point of constructing the decision tree is to determine the best attribute to split the considered node. Several methods to solve this problem were presented so far. However, they are either wrongly mathematically justified (e.g., in the Hoeffding tree algorithm) or time-consuming (e.g., in the McDiarmid tree algorithm). In this paper, we propose a new method which significantly outperforms the McDiarmid tree algorithm and has a solid mathematical basis. Our method ensures, with a high probability set by the user, that the best attribute chosen in the considered node using a finite data sample is the same as it would be in the case of the whole data stream.
21
Data mining: concepts and techniques
Jiawei Han, Micheline Kamber · Choice Reviews Online · 2012 · 28.9K citations
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
Classification and Regression Trees.
John Van Ryzin, Leo Breiman, Jerome H. Friedman et al. · Journal of the American Statistical Association · 1986 · 21K citations
Nearest neighbor pattern classification
Thomas M. Cover, Peter E. Hart · IEEE Transactions on Information Theory · 1967 · 16.1K citations
Introduction to the theory of neural computation
Neural Networks · 1994 · 6.5K citations