By Topic

Induction of ordinal decision trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Lee, J.W.T. ; Dept. of Comput., Hong Kong Polytech. Univ. Hung Hom, China ; Da-Zhong Liu

In many disciplines, such as social and behavioral sciences, we often have to do ordinal classification by assigning objects to ordinal classes. The fundamental objective of ordinal classification is to create an ordering in the universe of discourse. As such, a decision tree for ordinal classification should aim at producing an ordering which is most consistent with the implicit ordering in the input data. Ordinal classification problems are often dealt with by treating ordinal classes as nominal classes, or by representing the classes as values on a quantitative scale. Such approaches may not lead to the most desirable results since the methods do not fit the type of data, viz. ordinal data, concerned. In this paper, we propose a new measure for assessing the quality of output from an ordinal classification approach. We also propose an induction method to generate an ordinal decision tree for ordinal classification based on this quality perspective. We demonstrate the advantage of our method using results from a set of experiments.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:4 )

Date of Conference:

4-5 Nov. 2002