Ziv Bar-Yossef, T.S. Jayram, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
Paper
Comparing partial rankings
Abstract
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Related
Marco A. Casanova, Ronald Fagin, et al.
SIGMOD/PODS 1982
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics
Conference paper
Unweaving a web of documents
R. Guha, D. Sivakumar, et al.
KDD 2005