Approximation of average ranks in posets
- Author
- Karel De Loof (UGent) , Bernard De Baets (UGent) and Hans De Meyer (UGent)
- Organization
- Abstract
- Objects that are described by attribute vectors often need to be ranked. A popular approach not requiring subjective assumptions ranks the objects on the basis of their average rank in the linear extensions of the induced partially ordered set, or poset for short. Since the exact computation of average ranks in posets with many incomparable objects is infeasible with current technology, approximations are required. In this paper we introduce a new formula.
- Keywords
- LATTICE, RANDOM GENERATION, LINEAR EXTENSIONS
Downloads
-
(...).pdf
- full text
- |
- UGent only
- |
- |
- 1.13 MB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-2049119
- MLA
- De Loof, Karel, et al. “Approximation of Average Ranks in Posets.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 66, no. 1, 2011, pp. 219–29.
- APA
- De Loof, K., De Baets, B., & De Meyer, H. (2011). Approximation of average ranks in posets. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 66(1), 219–229.
- Chicago author-date
- De Loof, Karel, Bernard De Baets, and Hans De Meyer. 2011. “Approximation of Average Ranks in Posets.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 66 (1): 219–29.
- Chicago author-date (all authors)
- De Loof, Karel, Bernard De Baets, and Hans De Meyer. 2011. “Approximation of Average Ranks in Posets.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 66 (1): 219–229.
- Vancouver
- 1.De Loof K, De Baets B, De Meyer H. Approximation of average ranks in posets. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY. 2011;66(1):219–29.
- IEEE
- [1]K. De Loof, B. De Baets, and H. De Meyer, “Approximation of average ranks in posets,” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 66, no. 1, pp. 219–229, 2011.
@article{2049119,
abstract = {{Objects that are described by attribute vectors often need to be ranked. A popular approach not requiring subjective assumptions ranks the objects on the basis of their average rank in the linear extensions of the induced partially ordered set, or poset for short. Since the exact computation of average ranks in posets with many incomparable objects is infeasible with current technology, approximations are required. In this paper we introduce a new formula.}},
author = {{De Loof, Karel and De Baets, Bernard and De Meyer, Hans}},
issn = {{0340-6253}},
journal = {{MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY}},
keywords = {{LATTICE,RANDOM GENERATION,LINEAR EXTENSIONS}},
language = {{eng}},
number = {{1}},
pages = {{219--229}},
title = {{Approximation of average ranks in posets}},
volume = {{66}},
year = {{2011}},
}