An experimental evaluation of simplicity in rule learning

  • Authors:
  • Ulrich Rückert;Luc De Raedt

  • Affiliations:
  • Institut für Informatik I12, Technische Universität München, Boltzmannstr. 3, D-85748 Garching, Germany;Department of Computer Science, Katholieke Universiteit Leuven, PO Box 02402, BE 3001 Heverlee, Belgium

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

While recent research on rule learning has focused largely on finding highly accurate hypotheses, we evaluate the degree to which these hypotheses are also simple, that is small. To realize this, we compare well-known rule learners, such as CN2, RIPPER, PART, FOIL and C5.0 rules, with the benchmark system SL^2 that explicitly aims at computing small rule sets with few literals. The results show that it is possible to obtain a similar level of accuracy as state-of-the-art rule learners using much smaller rule sets.