Advanced search

A hitchhiker's guide to poset ranking

Author
Organization
Abstract
When ranking objects (like chemicals, geographical sites, river sections, etc.) by multicriteria analysis, it is in most cases controversial and difficult to find a common scale among the criteria of concern. Therefore, ideally, one should not resort to such artificial additional constraints. The theory of partially ordered sets (or posets for short) provides a solid formal framework for the ranking of objects without assigning a common scale and/or weights to the criteria, and therefore constitutes a valuable alternative to traditional approaches. In this paper, we aim to give a comprehensive literature review on the topic. First we formalize the problem of ranking objects according to some predefined criteria. In this theoretical framework, we focus on several algorithms and illustrate them on a toy example. To conclude, a more realistic real-world application shows the power of some of the algorithms considered in this paper.

Citation

Please use this url to cite or link to this publication:

Chicago
De Loof, Karel, Bernard De Baets, Hans De Meyer, and Rainer Bruggeman. 2008. “A Hitchhiker’s Guide to Poset Ranking.” Combinatorial Chemistry & High Throughput Screening 11 (9): 734–744.
APA
De Loof, K., De Baets, B., De Meyer, H., & Bruggeman, R. (2008). A hitchhiker’s guide to poset ranking. Combinatorial Chemistry & High Throughput Screening, 11(9), 734–744.
Vancouver
1.
De Loof K, De Baets B, De Meyer H, Bruggeman R. A hitchhiker’s guide to poset ranking. Combinatorial Chemistry & High Throughput Screening. 2008;11(9):734–44.
MLA
De Loof, Karel, Bernard De Baets, Hans De Meyer, et al. “A Hitchhiker’s Guide to Poset Ranking.” Combinatorial Chemistry & High Throughput Screening 11.9 (2008): 734–744. Print.
@article{519533,
  abstract     = {When ranking objects (like chemicals, geographical sites, river sections, etc.) by multicriteria analysis, it is in most cases controversial and difficult to find a common scale among the criteria of concern. Therefore, ideally, one should not resort to such artificial additional constraints. The theory of partially ordered sets (or posets for short) provides a solid formal framework for the ranking of objects without assigning a common scale and/or weights to the criteria, and therefore constitutes a valuable alternative to traditional approaches. In this paper, we aim to give a comprehensive literature review on the topic. First we formalize the problem of ranking objects according to some predefined criteria. In this theoretical framework, we focus on several algorithms and illustrate them on a toy example. To conclude, a more realistic real-world application shows the power of some of the algorithms considered in this paper.},
  author       = {De Loof, Karel and De Baets, Bernard and De Meyer, Hans and Bruggeman, Rainer},
  issn         = {1386-2073},
  journal      = {Combinatorial Chemistry \& High Throughput Screening},
  language     = {eng},
  number       = {9},
  pages        = {734--744},
  title        = {A hitchhiker's guide to poset ranking},
  volume       = {11},
  year         = {2008},
}

Web of Science
Times cited: