Cascade generalisation for ordinal problems
by Sotiris Kotsiantis, Dimitris Kanellopoulos
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 2, No. 1/2, 2010

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.

Online publication date: Sun, 04-Apr-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com