DocumentCode :
3122198
Title :
Induction of ordinal decision trees
Author :
Lee, John W T ; Liu, Da-zhong
Author_Institution :
Dept. of Comput., Hong Kong Polytech. Univ. Hung Hom, China
Volume :
4
fYear :
2002
fDate :
4-5 Nov. 2002
Firstpage :
2220
Abstract :
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.
Keywords :
decision trees; inference mechanisms; learning (artificial intelligence); pattern classification; induction method; ordinal classification; ordinal decision tree; pair comparison ordering; quantitative scale; training set; universe of discourse; Classification algorithms; Classification tree analysis; Computer science; Decision trees; Electronic mail; Induction generators; Mathematics; Prediction algorithms; Predictive models; Regression tree analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on
Print_ISBN :
0-7803-7508-4
Type :
conf
DOI :
10.1109/ICMLC.2002.1175434
Filename :
1175434
Link To Document :
بازگشت