Overcoming the Myopia of Inductive Learning Algorithms with RELIEFF

  • Authors:
  • Igor Kononenko;Edvard Šimec;Marko Robnik-Šikonja

  • Affiliations:
  • University of Ljubljana, Faculty of Computer and Information Science, Tržaška 25, SI-1001 Ljubljana, Slovenia E-mail: igor.kononenko@fri.uni-lj.si;University of Ljubljana, Faculty of Computer and Information Science, Tržaška 25, SI-1001 Ljubljana, Slovenia E-mail: igor.kononenko@fri.uni-lj.si;University of Ljubljana, Faculty of Computer and Information Science, Tržaška 25, SI-1001 Ljubljana, Slovenia E-mail: igor.kononenko@fri.uni-lj.si

  • Venue:
  • Applied Intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Current inductive machine learning algorithms typically use greedy search with limited lookahead. This prevents them to detect significant conditional dependencies between the attributes that describe training objects. Instead of myopic impurity functions and lookahead, we propose to use RELIEFF, an extension ofRELIEF developed by Kira and Rendell [10, 11],for heuristic guidance of inductive learningalgorithms. We have reimplemented Assistant, a system for top down induction of decision trees, using RELIEFF as an estimator of attributes at each selection step. The algorithm is tested on several artificial and several real world problems and the results are compared with some other well known machine learning algorithms. Excellent results on artificial data sets and two real world problems show the advantageof the presented approach to inductivelearning.