An Algorithm for Ordinal Classification Based on Pairwise Comparison

Yunli Yang, Baiyu Chen and Zhouwang Yang ()
Additional contact information
Yunli Yang: University of Science and Technology of China
Baiyu Chen: University of Science and Technology of China
Zhouwang Yang: University of Science and Technology of China

Journal of Classification, 2020, vol. 37, issue 1, No 10, 158-179

Abstract: Abstract Ordinal classification problems are applied in many fields. In the field of multivariate statistical analysis, these tasks are referred to as ordinal regression problems. In the field of management decision-making, they are known as multi-criteria decision analyses or sorting problems. This paper introduces the PairCode algorithm for ordinal classification with small sample sizes, which is based on a pairwise comparison strategy. In addition, this work outlines how to use pairwise comparisons to transform ordinal classifications into disordered regressions and how to transform the results of disordered regressions back to their original ordinal categories. Some effective strategies have been put forward, such as designing a class-label encoding matrix for the pairwise comparison, balancing samples, training classifiers, and predicting new samples. In numerical experiments, our algorithm (PairCode) is compared with the ordinal logistic regressions (LogisticOP) (Hu et al., IEEE Transactions on Knowledge and Data Engineering, 24(11), 2052–2064, 2012; Harrell 2015b), SVMOP (Gutiérrez et al., IEEE Transactions on Knowledge and Data Engineering, 28(1), 127–146, 2016; Leathart et al. 2016), SVORIM (Chu and Sathiya Keerthi, Neural Computation, 19(3), 792–815 2007; Gutiérrez et al., IEEE Transactions on Knowledge and Data Engineering, 28(1), 127–146, 2016), SVOREX (Chu and Sathiya Keerthi, Neural Computation, 19(3), 792–815 2007; Gutiérrez et al., IEEE Transactions on Knowledge and Data Engineering, 28(1), 127–146, 2016), and ELMOP (Deng et al., Neurocomputing, 74(1), 447–456, 2010; Gutiérrez et al., IEEE Transactions on Knowledge and Data Engineering, 28(1), 127–146, 2016). The results show that the PairCode algorithm performs better and is relatively stable as reflected by the correct classification rate (CCR), the mean absolute error (MAE), and the maximum MAE value (MMAE). However, the computing speed of the PairCode algorithm for classification is slightly slow and therefore warrants further study to improve the speed.

Keywords: Ordinal classification; Pairwise comparison; Balanced samples; Angle distance; Mean absolute error (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00357-019-9311-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jclass:v:37:y:2020:i:1:d:10.1007_s00357-019-9311-4

Ordering information: This journal article can be ordered from
http://www.springer. ... hods/journal/357/PS2

DOI: 10.1007/s00357-019-9311-4

Access Statistics for this article

Journal of Classification is currently edited by Douglas Steinley

More articles in Journal of Classification from Springer, The Classification Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().