Soumen Chakrabarti, Byron E. Dom, et al.
Artificial Intelligence Review
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
Query strategies for priced information (extended abstract)
Moses Charikar, Ronald Fagin, et al.
STOC 2000
Ravi Kumar, Uma Mahadevan, et al.
KDD 2004
Conference paper
Dichotomies in the Complexity of Preferred Repairs
Ronald Fagin, Benny Kimelfeld, et al.
SIGMOD/PODS 2015