Advanced search
1 file | 1.13 MB

Approximation of average ranks in posets

Karel De Loof (UGent) , Bernard De Baets (UGent) and Hans De Meyer (UGent)
Author
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
    • |
    • PDF
    • |
    • 1.13 MB

Citation

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

Chicago
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.
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.
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.
MLA
De Loof, Karel, Bernard De Baets, and Hans De Meyer. “Approximation of Average Ranks in Posets.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 66.1 (2011): 219–229. Print.
@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},
  keyword      = {LATTICE,RANDOM GENERATION,LINEAR EXTENSIONS},
  language     = {eng},
  number       = {1},
  pages        = {219--229},
  title        = {Approximation of average ranks in posets},
  volume       = {66},
  year         = {2011},
}

Web of Science
Times cited: