Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2929))

Abstract

In this paper, we discuss how a proper definition of a ranking can be introduced in the framework of supervised learning. We elaborate on its practical representation, and show how we can deal in a sound way with reversed preferences by transforming them into uncertainties within the representation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agresti, A.: An introduction to categorical data analysis. John Wiley & Sons, New York (1996)

    MATH  Google Scholar 

  2. Ben-David, A.: Automatic generation of symbolic multiattribute ordinal knowledgebased dss: Methodology and applications. Decision Sciences 23, 1357–1372 (1992)

    Article  Google Scholar 

  3. Ben-David, A.: Monotonicity maintenance in information-theoretic machine learning algorithms. Machine Learning 9, 29–43 (1995)

    Google Scholar 

  4. Bouyssou, D.: Building criteria: a prerequisite for MCDA. In: Bana e Costa, C. (ed.) Readings in Multiple Criteria Decision Aid, pp. 58–80. Springer, Heidelberg (1990)

    Google Scholar 

  5. Fishburn, P.C.: Interval orders and interval graphs. John Wiley, Chichester (1985)

    MATH  Google Scholar 

  6. Fishburn, P.C.: Generalizations of semiorders: A review note. Journal of Mathematical Psychology 41, 357–366 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Frank, E., Hall, M.: A simple approach to ordinal classification. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, pp. 145–156. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Gediga, G., Düntsch, I.: Approximation quality for sorting rules. Computational Statistics and Data Analysis 40, 499–526 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Greco, S., Mattarazo, B., Słowiński, S.: Rough set theory for multicriteria decision analysis. European Journal of Operational Research 129, 1–47 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Smola, A., Bartlett, P., Schölkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 115–132. MIT Press, Cambridge (2000)

    Google Scholar 

  11. Komorowski, J., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough-Fuzzy Hybridization: A New Method for Decision Making, pp. 3–98. Springer, Singapore (1998)

    Google Scholar 

  12. Luce, R.D.: Several unresolved conceptual problems of mathematical psychology. Journal of Mathematical Psychology 41, 79–87 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Makino, K., Suda, T., Ono, H., Ibaraki, T.: Data analysis by positive decision trees. IEICE Trans. Inf. and Syst. E82-D, 76–88 (1999)

    Google Scholar 

  14. Potharst, R., Bioch, J.C., van Dordregt, R.: Quasi-monotone decision trees for ordinal classification, Tech. Report EUR-FEW-CS-98-01, Erasmus University Rotterdam (1998)

    Google Scholar 

  15. Potharst, R., Bioch, J.C.: Decision trees for ordinal classification. Intelligent Data Analysis 4, 97–112 (2000)

    MATH  Google Scholar 

  16. Roy, B.: Multicriteria methodology for decision aiding. Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

  17. Shashua, A., Levin, A.: Taxonomy of large margin principle algorithms for ordinal regression problems, Tech. Report 2002-39, Leibniz Center for Research, School of Computer Science and Eng., the Hebrew University of Jerusalem (2002)

    Google Scholar 

  18. Stefanowski, J.: On rough set based approaches to induction of decicion rules. In: Skowron, S., Polkowski, L. (eds.) Rough Sets in Data Mining and Knowledge Discovery, pp. 500–529. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  19. Vincke, P.: Basic concepts of preference modelling. In: Bana e Costa, C. (ed.) Readings in Multiple Criteria Decision Aid, pp. 101–118. Springer, Heidelberg (1990)

    Google Scholar 

  20. Webster’s Encyclopedia Unabridged Dictionary of the English Language, Gramercy Books, New York (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cao-Van, K., De Baets, B. (2003). Consistent Representation of Rankings. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds) Theory and Applications of Relational Structures as Knowledge Instruments. Lecture Notes in Computer Science, vol 2929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24615-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24615-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20780-1

  • Online ISBN: 978-3-540-24615-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics