Comparing and aggregating partial orders with Kendall tau distances

DOI10.1007/978-3-642-28076-4_11zbMATH Open1294.06001OpenAlexW84142378MaRDI QIDQ2889903FDOQ2889903

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

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28076-4_11

Recommendations

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

Mathematics Subject Classification ID

Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)

Cited In (8)

• Comparing machine learning algorithms by union-free generic depth
• A linear ordering problem of sets
• On a weighted generalization of Kendall's tau distance
• On the comparison of the Spearman and Kendall metrics between linear orders.
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances
• Beyond rankings: comparing directed acyclic graphs

This page was built for publication: Comparing and aggregating partial orders with Kendall tau distances

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