By Topic

An Efficient Classification System Based on Binary Search Trees for Data Streams Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Tao Wang ; National University of Defense Technology, Changsha, 410073, China ; Zhoujun Li ; Yuejin Yan ; Huowang Chen
more authors

Decision tree construction is a well-studied problem in data mining. Recently, there has been much interest in mining data streams. Domingos and Hulten have presented a one-pass algorithm for decision tree constructions. Their system using Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed. In this paper, we revisit this problem and propose a decision tree classifier system that uses binary search trees to handle numerical attributes. The proposed system is based on the most successful VFDT, and it achieves excellent performance. The most relevant property of our system is an average large reduction in processing time, while keeps the same tree size and accuracy.

Published in:

Systems, 2007. ICONS '07. Second International Conference on

Date of Conference:

22-28 April 2007