Cart (Loading....) | Create Account
Close category search window

Decision Tree Merging Branches Algorithm Based on Equal Predictability

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
$31 $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

3 Author(s)
Daojing Hu ; Sch. of Comput. Sci. & Technol., Soochow Univ., Suzhou, China ; Quan Liu ; Qicui Yan

Traditionally the algorithm of ID3 is a greedy algorithm which searches and compares the attribute of each level in the decision tree. During the process of selection of expanded attributes, attributes with more values are usually preferred to be selected. It results in a decision tree with large scale consequently, so a new merging branches algorithm EPMID in decision tree is proposed in this paper. The algorithm uses the pre-pruning strategy, and merges the non-leaf branches which have the equal predictability. The experimental results show that the improved algorithm reduced the width and the leaf nodes of the decision tree. The time complexity and space complexity and classification precision are superior to ID3.

Published in:

Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on  (Volume:3 )

Date of Conference:

7-8 Nov. 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.