.png){kind=icon}
返回
Decision Trees for Mining Data Streams Based on the Gaussian Approximation
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2013.34.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Data steam
decision trees
information gain
Gaussian approximation
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
Prolonged suppression of the innate immune system in the horse following an 80 km endurance race
OAAI
OAAI分享收藏分享收藏
查看更多内容