Cranking: Combining Rankings Using Conditional Probability Models on Permutations (2002)
Cached
Download Links
- [www-2.cs.cmu.edu]
- [www.cc.gatech.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 19th International Conference on Machine Learning |
| Citations: | 31 - 3 self |
BibTeX
@INPROCEEDINGS{Lebanon02cranking:combining,
author = {Guy Lebanon and John Lafferty},
title = {Cranking: Combining Rankings Using Conditional Probability Models on Permutations},
booktitle = {In Proceedings of the 19th International Conference on Machine Learning},
year = {2002},
pages = {363--370}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new approach to ensemble learning is introduced that takes ranking rather than classification as fundamental, leading to models on the symmetric group and its cosets. The approach uses a generalization of the Mallows model on permutations to combine multiple input rankings. Applications include the task of combining the output of multiple search engines and multiclass or multilabel classification, where a set of input classifiers is viewed as generating a ranking of class labels.
