Karel De Loof
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Karel De Loof has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bernard De Baets
KERMIT, Department of Data Analysis and Mathematical Modelling, Ghent University, Gent, Belgium
7 shared publications H. De Meyer
Department of Applied Mathematics and Computer Science, Ghent University, Gent, Belgium
5 shared publicationsHans De Meyer
1 shared publication- Hans De Meyer
Ghent University
1 shared publication Rainer Bruggemann
1 shared publication
Latest Publications
- 16 December 2014
- Published by Institute of Information Theory and Automation in Kybernetika
- p. 814-837
Cycle-free cuts of mutual rank probability relations
- 16 December 2014
- Published by Institute of Information Theory and Automation in Kybernetika
- p. 814-837
Cycle-free cuts of mutual rank probability relations
- 5 October 2012
- Published by Springer Nature in 4OR
- Vol. 11 (2) , 151-170
A necessary 4-cycle condition for dice representability of reciprocal relations
- 5 October 2012
- Published by Springer Nature in 4OR
- Vol. 11 (2) , 151-170
A necessary 4-cycle condition for dice representability of reciprocal relations
- 15 May 2010
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 161 (20) , 2695-2708
On the cycle-transitivity of the mutual rank probability relation of a poset
- 15 May 2010
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 161 (20) , 2695-2708
On the cycle-transitivity of the mutual rank probability relation of a poset
- 1 January 2010
- Published by Springer Nature
- p. 155-163
How to Avoid LEM Cycles in Mutual Rank Probability Relations
- 1 January 2010
- Published by Springer Nature
- p. 155-163
How to Avoid LEM Cycles in Mutual Rank Probability Relations
- 1 November 2008
- Published by Bentham Science Publishers Ltd. in Combinatorial Chemistry & High Throughput Screening
- Vol. 11 (9) , 734-744
A Hitchhikers Guide to Poset Ranking
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 realworld application shows the power of some of the algorithms considered in this paper.
- 1 November 2008
- Published by Bentham Science Publishers Ltd. in Combinatorial Chemistry & High Throughput Screening
- Vol. 11 (9) , 734-744
A Hitchhikers Guide to Poset Ranking
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 realworld application shows the power of some of the algorithms considered in this paper.
- 1 August 2008
- Published by Elsevier in Information Processing Letters
- Vol. 107 (6) , 216-220
On the random generation of monotone data sets
- 1 August 2008
- Published by Elsevier in Information Processing Letters
- Vol. 107 (6) , 216-220
On the random generation of monotone data sets
- 1 January 2007
- Published by Elsevier in Information Sciences
- Vol. 177 (1) , 220-230
On the random generation and counting of weak order extensions of a poset with given class cardinalities
- 1 January 2007
- Published by Elsevier in Information Sciences
- Vol. 177 (1) , 220-230
On the random generation and counting of weak order extensions of a poset with given class cardinalities