Computing distances between partial rankings

DOI10.1016/j.ipl.2008.10.010zbMath1191.68820OpenAlexW1995099952MaRDI QIDQ976084

Mukul S. Bansal, David Fernández Baca

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.010

zbMATH Keywords

algorithmspartial rankingsKendall tau distance\(p\)-ratingstop-\(m\) lists

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

Ranking chain sum orders ⋮ Partial evaluation in rank aggregation problems ⋮ Order distances and split systems ⋮ Versatile string kernels

Cites Work

• Unnamed Item
• Unnamed Item
• Metric methods for analyzing partially ranked data
• Comparing Top k Lists
• Comparing Partial Rankings

This page was built for publication: Computing distances between partial rankings