Computing distances between partial rankings

DOI10.1016/J.IPL.2008.10.010MaRDI QIDQ976084zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Comparing Partial Rankings
• An efficient approach for the rank aggregation problem
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances
• Computing similarity distances between rankings

Cites work

• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Comparing Partial Rankings
• Comparing Top k Lists
• Metric methods for analyzing partially ranked data

Cited in

(12)

• Versatile string kernels
• Order distances and split systems
• Comparing Top k Lists
• Comparing Partial Rankings
• Ranking chain sum orders
• An axiomatic approach to distance on partial orderings
• Partial evaluation in rank aggregation problems
• DISTALITY RANK
• scientific article; zbMATH DE number 2079318 (Why is no real title available?)
• An efficient approach for the rank aggregation problem
• Computing similarity distances between rankings
• Distances and consensus rankings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976084)