Name
Abstract | ||
|---|---|---|
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta- searching and information retrieval, search engine spam fighting, e-commerce, learning from experts, analysis of population preference sampling, committee decision making and more. We improve recent constant factor approximation algorithms for aggregation of full rankings and generalize them to partial rankings. Our algorithms improved constant factor approximation with respect to all metrics discussed in Fagin et al's recent important work on comparing partial rankings. We pay special attention to two important types of partial rankings: the well-known top-m lists and the more general p-ratings which we define. We provide first evidence for hardness of aggregating them for constant m, p. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00453-008-9211-1 | Algorithmica |
Keywords | DocType | Volume |
important type,full ranking,information retrieval,constant factor approximation,search engine spam fighting,recent constant factor approximation,population preference sampling,partial ranking,top-m lists,committee decision,partial rankings,general p-ratings,search engine,e commerce,approximation algorithms | Journal | 57 |
Issue | ISSN | ISBN |
2 | 0178-4617 | 978-0-89871-624-5 |
Citations | PageRank | References |
40 | 2.64 | 14 |
Authors | ||
1 | ||