A Distance-Based Attribute Selection Measure for Decision Tree Induction

  • Authors:
  • R. López De Mántaras

  • Affiliations:
  • Centre of Advanced Studies, CSIC, 17300 Blanes, Girona, Spain. MANTARAS@CEAB.ES

  • Venue:
  • Machine Learning
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

This note introduces a new attribute selection measure for ID3-like inductive algorithms. This measure is based on a distance between partitions such that the selected attribute in a node induces the partition which is closest to the correct partition of the subset of training examples corresponding to this node. The relationship of this measure with Quinlan's information gain is also established. It is also formally proved that our distance is not biased towards attributes with large numbers of values. Experimental studies with this distance confirm previously reported results showing that the predictive accuracy of induced decision trees is not sensitive to the goodness of the attribute selection measure. However, this distance produces smaller trees than the gain ratio measure of Quinlan, especially in the case of data whose attributes have significantly different numbers of values.