Computing distances between partial rankings
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements. and with b and c equivalence classes, respectively, our first algorithm runs in O (n log n/log log n) time, and the second in O (n log min{b, c}) time. (C) 2008 Elsevier B.V. All rights reserved.
partial rankings algorithms p-ratings top-m lists kendall tau distance