Is an ordinal class structure useful in classifier learning?

Jens C. Huhn and Eyke Hullermeier

International Journal of Data Mining, Modelling and Management, 2008, vol. 1, issue 1, 45-67

Abstract: In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, the order information of the problem, essentially relying on the assumption that the ordinal structure of the set of class labels is also reflected in the topology of the instance space. The purpose of this paper is to investigate, on an experimental basis, the validity of this assumption. Moreover, we seek to answer the question to what extent existing techniques and learning algorithms for ordinal classification are able to exploit order information and which properties of these techniques are important in this regard.

Keywords: ordinal classification; binary decomposition; nested dichotomies; pairwise classification; class structure; classifier learning; machine learning. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=22537 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:1:y:2008:i:1:p:45-67

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().