Skip to Content
MDPIMDPI
MCAMathematical and Computational Applications
PDF
  • Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).
  • Article
  • Open Access

1 April 2005

Pruning Decision Trees using Rules3 Inductive Learning Algorithm

King Saud University, College of Computer and Information Sciences, P.O.Box 51178, Riyadh, 11543, Saudi Arabia
Math. Comput. Appl.2005, 10(1), 113-120;https://doi.org/10.3390/mca10010113
Version Notes
Order Reprints

Abstract

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.

Article Metrics

Citations

Article Access Statistics

Journal Statistics
Multiple requests from the same IP address are counted as one view.
Estimation of Hourly Mean Ambient Temperatures with Artificial Neural Networks
Previous
An Algorithm for Segment Stability
Next