Fogel, Fajwel, d'Aspremont, Alexandre and Vojnovic, Milan 
ORCID: 0000-0003-1382-022X
(2016)
Spectral ranking using seriation.
Journal of Machine Learning Research, 17.
1 - 45.
ISSN 1532-4435
|
PDF
- Published Version
Download (626kB) | Preview |
Abstract
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder this matrix and construct a ranking. We first show that this spectral seriation algorithm recovers the true ranking when all pairwise comparisons are observed and consistent with a total order. We then show that ranking reconstruction is still exact when some pairwise comparisons are corrupted or missing, and that seriation based spectral ranking is more robust to noise than classical scoring methods. Finally, we bound the ranking error when only a random subset of the comparions are observed. An additional benefit of the seriation formulation is that it allows us to solve semi-supervised ranking problems. Experiments on both synthetic and real datasets demonstrate that seriation based spectral ranking achieves competitive and in some cases superior performance compared to classical ranking methods.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.jmlr.org/ |
| Additional Information: | © 2016 The Authors |
| Divisions: | Statistics |
| Subjects: | H Social Sciences > HA Statistics Q Science > QA Mathematics |
| Date Deposited: | 25 Jan 2017 13:35 |
| Last Modified: | 21 Nov 2024 04:54 |
| URI: | http://eprints.lse.ac.uk/id/eprint/68987 |
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics