Ronald Fagin
Journal of Logic and Computation
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
C.J. Date, Ronald Fagin
SIGMOD Record
Conference paper
Self-similarity in the web
Stephen Dill, Ravi Kumar, et al.
VLDB 2001
Ronald Fagin, Joseph Y. Halpern, et al.
Artificial Intelligence