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

DOI10.1007/S10878-012-9467-XzbMATH Open1298.90082OpenAlexW2083762248WikidataQ61687294 ScholiaQ61687294MaRDI QIDQ2392744FDOQ2392744

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

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

zbMATH Keywords

rank aggregationrankingpartial ordersfixed-parameter tractabilitySpearman footrule distance

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)