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
Conference paper
Searching the workplace web
Ronald Fagin, Ravi Kumar, et al.
WWW 2003
Joseph Y. Halpern, Ronald Fagin
PODC 1985
Conference paper
Composition with target constraints
Marcelo Arenas, Ronald Fagin, et al.
ICDT 2010