IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v37y2020i1d10.1007_s00357-019-9311-4.html
   My bibliography  Save this article

An Algorithm for Ordinal Classification Based on Pairwise Comparison

Author

Listed:
  • 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)

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.

Suggested Citation

  • Yunli Yang & Baiyu Chen & Zhouwang Yang, 2020. "An Algorithm for Ordinal Classification Based on Pairwise Comparison," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 158-179, April.
    • Handle: RePEc:spr:jclass:v:37:y:2020:i:1:d:10.1007_s00357-019-9311-4
    DOI: 10.1007/s00357-019-9311-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-019-9311-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-019-9311-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Potharst, R. & Feelders, A.J., 2002. "Classification Trees for Problems with Monotonicity Constraints," ERIM Report Series Research in Management ERS-2002-45-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Du, Wen Sheng & Hu, Bao Qing, 2018. "A fast heuristic attribute reduction approach to ordered decision systems," European Journal of Operational Research, Elsevier, vol. 264(2), pages 440-452.
    2. Tyler J. VanderWeele & James M. Robins, 2010. "Signed directed acyclic graphs for causal inference," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 72(1), pages 111-127, January.
    3. S. Lievens & B. De Baets & K. Cao-Van, 2008. "A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting," Annals of Operations Research, Springer, vol. 163(1), pages 115-142, October.
    4. Doumpos, Michael & Zopounidis, Constantin, 2011. "Preference disaggregation and statistical learning for multicriteria decision support: A review," European Journal of Operational Research, Elsevier, vol. 209(3), pages 203-214, March.
    5. Yang, Bill Huajian, 2019. "Monotonic Estimation for Probability Distribution and Multivariate Risk Scales by Constrained Minimum Generalized Cross-Entropy," MPRA Paper 93400, University Library of Munich, Germany.
    6. Yang, Bill Huajian, 2019. "Resolutions to flip-over credit risk and beyond," MPRA Paper 93389, University Library of Munich, Germany.
    7. Yang, Bill Huajian, 2019. "Monotonic Estimation for the Survival Probability over a Risk-Rated Portfolio by Discrete-Time Hazard Rate Models," MPRA Paper 93398, University Library of Munich, Germany.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:37:y:2020:i:1:d:10.1007_s00357-019-9311-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.