Parallel Hoeffding decision tree for streaming data

作     者：Cal, Piotr Woźniak, Michal 

作者机构：Wroclaw University of Technology Department of Systems and Computer Networks Wybrzeze Wyspiańskiego 27 50-370 Wroclaw Poland 

出 版 物：《Advances in Intelligent Systems and Computing》 (Adv. Intell. Sys. Comput.)

年 卷 期：2013年第217卷

页      面：27-35页

核心收录：

主　　题：Decision trees 

摘      要：Decision trees are well known, widely used algorithm for building efficient *** propose the modification of the Parallel Hoeffding Tree algorithm that could deal with large streaming data. The proposed method were evaluated on the basis of computer experiment which were carried on few real datasets. The algorithm uses parallel approach and the Hoeffding inequality for better performance with large streaming data. The paper present the analysis of Hoeffding tree and its issues. © Springer International Publishing Switzerland 2013.