Issue No. 01 - Jan. (2014 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.34
Leszek Rutkowski , Czestochowa University of Technology, Czestochowa
Maciej Jaworski , Czestochowa University of Technology, Czestochowa
Lena Pietruczuk , Czestochowa University of Technology, Czestochowa
Piotr Duda , Czestochowa University of Technology, Czestochowa
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.
Decision trees, Entropy, Training, Data mining, Impurities, Indexes, Random variables
L. Rutkowski, M. Jaworski, L. Pietruczuk and P. Duda, "Decision Trees for Mining Data Streams Based on the Gaussian Approximation," in IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. 1, pp. 108-119, 2013.