Ronald Fagin, Phokion G. Kolaitis, et al.
ACM TODS
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
Ronald Fagin, Jonathan Lenchner, et al.
Logical Methods in Computer Science
Conference paper
The predictive power of online chatter
Daniel Gruhl, R. Guha, et al.
KDD 2005
Conference paper
A note on the set systems used for broadcast encryption
Ravi Kumar, Alexander Russell
SODA 1998