Conference paper
Algorithms for ℓp low-rank approximation
Flavio Chierichetti, Sreenivas Gollapudi, et al.
ICML 2017
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
Normal forms and relational database operators
Ronald Fagin
SIGMOD 1979
Ronald Fagin, Joseph Y. Halpern, et al.
Journal of the ACM