On learning algorithm selection for classification

  • Authors:
  • Shawkat Ali;Kate A. Smith

  • Affiliations:
  • Faculty of Information Technology, Monash University, P.O. Box 63B, Vic. 3800, Australia;Faculty of Information Technology, Monash University, P.O. Box 63B, Vic. 3800, Australia

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper introduces a new method for learning algorithm evaluation and selection, with empirical results based on classification. The empirical study has been conducted among 8 algorithms/classifiers with 100 different classification problems. We evaluate the algorithms' performance in terms of a variety of accuracy and complexity measures. Consistent with the No Free Lunch theorem, we do not expect to identify the single algorithm that performs best on all datasets. Rather, we aim to determine the characteristics of datasets that lend themselves to superior modelling by certain learning algorithms. Our empirical results are used to generate rules, using the rule-based learning algorithm C5.0, to describe which types of algorithms are suited to solving which types of classification problems. Most of the rules are generated with a high confidence rating.