Skip to main content
SpringerLink
Log in

On the Definition and Representation of a Ranking

  • Conference paper
  • First Online:
Relational Methods in Computer Science (RelMiCS 2001)

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

Included in the following conference series:

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

Log in via an institution
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. A. Ben-David, Automatic generation of symbolic multiattribute ordinal knowledgebased DSSs: methodology and applications. Decision Sciences 23 (1992), 1357–1372.

    Article  Google Scholar 

  2. G. Gediga and I. Düntsch, Approximation quality for sorting rules, submitted.

    Google Scholar 

  3. S. Greco, B. Mattarazo and S. Słlowiński, Rough set theory for multicriteria decision analysis. European J. Oper. Res. 129 (2000), 1–47.

    Article  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  6. B. Roy, Multicriteria Methodology for Decision Aiding. Kluwer Academic Publishers, Dordrecht, 1996.

    MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Biometrics and Process Control Ghent University, Coupure links 653, B-9000, Gent, Belgium

    Kim Cao-Van & Bernard De Baets

Authors
  1. Kim Cao-Van
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard De Baets
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tilburg University, P.O. Box 90153, 5000, LE Tilburg, The Netherlands

    Harrie C. M. de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao-Van, K., De Baets, B. (2002). On the Definition and Representation of a Ranking. In: de Swart, H.C.M. (eds) Relational Methods in Computer Science. RelMiCS 2001. Lecture Notes in Computer Science, vol 2561. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36280-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-36280-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36280-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation