Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Title Pruning Decision Trees Using Rules3 Inductive Learning
Document related concepts
Factorization of polynomials over finite fields wikipedia , lookup
Pattern recognition wikipedia , lookup
Computational complexity theory wikipedia , lookup
Natural computing wikipedia , lookup
Artificial intelligence wikipedia , lookup
Machine learning wikipedia , lookup
Theoretical computer science wikipedia , lookup
Transcript
Title Author(s) Contact Info Department Major Citation Year of Publication Publisher Sponsor Type of Publication ISBN URL/DOI Full Text (Yes, No) Keywords Abstract Pruning Decision Trees Using Rules3 Inductive Learning Algorithm M.S. Aksoy [email protected] , Telephone # :4677697, Address: King Saud University College of Computer and Information Sciences P.O.Box 51178 RIYADH 11543 Saudi Arabia Information Systems Artificial Intelligence Mathematical & Computational Applications An International Journal, Vol. 10, No. 1, pp. 113-120. 2005 ASR ASR Journal Paper http://www.asr.org.tr/vol10_1.html Yes Induction, Inductive Learning, Decision Tress, Pruning. One important disadvantage of decision tree based inductive learning algorithms is that they use some irrelevant values to establish the decision tree. This causes the final rule set to be less general. To overcome with this problem the tree has to be pruned. In this article using the recently developed RULES inductive learning algorithm, pruning of a decision tree is explained. The decision tree is extracted for an example problem using the ID3 algorithm and then is pruned using RULES. The results obtained before and after pruning are compared. This shows that the pruned decision tree is more general.
