The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders

DOI10.1007/S10878-012-9467-XMaRDI QIDQ2392744zbMATHOpenAlexWikidataFDO

Authors Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier

Publication date 2 August 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9467-x

zbMATH Keywords

rank aggregationrankingpartial ordersfixed-parameter tractabilitySpearman footrule distance

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Recommendations

• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances
• Comparing and aggregating partial orders with Kendall tau distances
• Ranking chain sum orders
• On maximum rank aggregation problems

Cites work

• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• scientific article; zbMATH DE number 1288298 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• scientific article; zbMATH DE number 3061662 (Why is no real title available?)
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Comparing Partial Rankings
• Comparing Top k Lists
• Comparing and aggregating partial orders with Kendall tau distances
• Exact analysis of Dodgson elections
• Fixed-parameter tractability results for feedback set problems in tournaments
• Kernels for feedback arc set in tournaments
• Metric methods for analyzing partially ranked data
• On the complexity of crossings in permutations
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(7)

• Comparing and aggregating partial orders with Kendall tau distances
• Ranking chain sum orders
• Beyond rankings: comparing directed acyclic graphs
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances
• On the hardness of maximum rank aggregation problems
• Computing distances between partial rankings

This page was built for publication: The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders

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