Computing distances between partial rankings

Information Processing Letters

Volumn 109, Issue 4, 2009, Pages 238-241

  Bansal, Mukul S ^a   Fernández Baca, David ^a  

^a Iowa State University   (United States)

Author keywords

Algorithms; Kendall tau distance; p ratings; Partial rankings; Top m lists

Indexed keywords

SET THEORY;

COMPUTING DISTANCES; EFFICIENT ALGORITHMS; KENDALL TAU DISTANCE; P-RATINGS; PARTIAL RANKINGS;

EQUIVALENCE CLASSES;

EID: 57749088479     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.10.010     Document Type: Article

References (8)

1. Critchlow D.E. Metric Methods for Analyzing Partially Ranked Data. Lecture Notes in Statist. vol. 34 (1980), Springer-Verlag, Berlin
2. Young H.P. Condorcet's theory of voting. American Political Science Review 82 2 (1988) 1231-1244
3. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the web, in: Tenth International World Wide Web Conference, Hong Kong, 2001, pp. 613-622
4. Fagin R., Kumar R., and Sivakumar D. Comparing top k lists. SIAM J. Discrete Math. (2003) 134-160
5. Fagin R., Kumar R., Mahdian M., Sivakumar D., and Vee E. Comparing partial rankings. SIAM J. Discrete Math. 20 3 (2006) 628-648
6. N. Ailon, Aggregation of partial rankings, p-ratings and top-m lists, in: SODA '07, 2007, pp. 415-424
7. P.F. Dietz, Optimal algorithms for list indexing and subset rank, in: WADS, 1989, pp. 39-46
8. Kleinberg J., and Tardos E. Algorithm Design (2005), Addison-Wesley Longman Publishing, Co., Inc., Boston, MA, USA