Cascade generalisation for ordinal problems

  • Authors:
  • Sotiris Kotsiantis;Dimitris Kanellopoulos

  • Affiliations:
  • Department of Mathematics, University of Patras, GR 265 00, Patras, Greece.;Educational Software Development Laboratory (ESDLab), Department of Mathematics, University of Patras, GR 265 00, Patras, Greece

  • Venue:
  • International Journal of Artificial Intelligence and Soft Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given an ordered class, a researcher is not only interested in minimising the classification error, but also in minimising the distances between the actual and the predicted class. This paper offers an organised study of the various methodologies that have tried to handle this problem and presents an experimental study of these methodologies with a proposed cascade generalisation technique, which combines the predictions of a classification tree and a model tree algorithm. The paper concludes that the proposed technique can be a more robust solution to the problem since it minimises the distance between the actual and the predicted class and improves the classification accuracy.