By Topic

A new decision-tree classification algorithm for machine learning

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

2 Author(s)
P. -L. Tu ; IBM Enterprise Syst., Poughkeepsie, NY, USA ; J. -Y. Chung

Although decision-tree classification algorithms have been widely used for machine learning in artificial intelligence, there has been little research toward evaluating the performance or quality of the current classification algorithms and investigating the time and computational complexity of constructing the smallest size decision tree which best distinguishes characteristics of multiple distinct groups. A known NP-complete problem, 3-exact cover, is used to prove that this problem is NP-complete. One prevalent classification algorithm in machine learning, ID3, is evaluated. The greedy search procedure used by ID3 is found to create anomalous behavior with inferior decision trees on a lot of occasions. A decision-tree classification algorithm, the intelligent decision-tree algorithm (IDA), that overcomes these anomalies with better classification performance is presented. A time analysis shows that IDA is more computationally efficient than ID3, and a simulation study indicates that IDA outperforms ID3

Published in:

Tools with Artificial Intelligence, 1992. TAI '92, Proceedings., Fourth International Conference on

Date of Conference:

10-13 Nov 1992