Journal
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 22, Issue 6, Pages 906-910Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2009.170
Keywords
Ordinal regression; linear discriminant analysis; kernel discriminant analysis
Categories
Funding
- National Science Foundation of China [50534050]
- National Key Technology R&D Program of China [2008BAK49B05]
- Knowledge Innovation Program of the Chinese Academy of Sciences
Ask authors/readers for more resources
Ordinal regression has wide applications in many domains where the human evaluation plays a major role. Most current ordinal regression methods are based on Support Vector Machines (SVM) and suffer from the problems of ignoring the global information of the data and the high computational complexity. Linear Discriminant Analysis (LDA) and its kernel version, Kernel Discriminant Analysis (KDA), take into consideration the global information of the data together with the distribution of the classes for classification, but they have not been utilized for ordinal regression yet. In this paper, we propose a novel regression method by extending the Kernel Discriminant Learning using a rank constraint. The proposed algorithm is very efficient since the computational complexity is significantly lower than other ordinal regression methods. We demonstrate experimentally that the proposed method is capable of preserving the rank of data classes in a projected data space. In comparison to other benchmark ordinal regression methods, the proposed method is competitive in accuracy.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available