Moving towards efficient decision tree construction

  • Authors:
  • B. Chandra;P. Paul Varghese

  • Affiliations:
  • Department of Mathematics, Indian Institute of Technology, New Delhi 110016, India;Department of Mathematics, Indian Institute of Technology, New Delhi 110016, India

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.08

Visualization

Abstract

Motivated by the desire to construct compact (in terms of expected length to be traversed to reach a decision) decision trees, we propose a new node splitting measure for decision tree construction. We show that the proposed measure is convex and cumulative and utilize this in the construction of decision trees for classification. Results obtained from several datasets from the UCI repository show that the proposed measure results in decision trees that are more compact with classification accuracy that is comparable to that obtained using popular node splitting measures such as Gain Ratio and the Gini Index.