Conference paper
What Can Machines Know? On the Epistemic Properties of Machines
Ronald Fagin, Joseph Y. Halpern, et al.
AAAI 1986
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
Catriel Beeri, Ronald Fagin, et al.
Journal of the ACM
Conference paper
Algorithms for ℓp low-rank approximation
Flavio Chierichetti, Sreenivas Gollapudi, et al.
ICML 2017
Ravi Kumar, D. Sivakumar
ACM-SIAM 2001