Rank correlation coefficient correction by removing worst cases

DOI10.1007/978-3-642-14055-6_37MaRDI QIDQ3164019zbMATH OpenOpenAlexFDO

Authors Martin Krone, Frank Klawonn

Publication date 27 October 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14055-6_37

zbMATH Keywords

greedy algorithmgraph algorithmsrank correlation coefficient

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Recommendations

• Robust rank correlation coefficients on the basis of fuzzy orderings: initial steps
• A new rank correlation coefficient with application to the consensus ranking problem
• Rank correlation methods for missing data
• A WEIGHTED RANK MEASURE OF CORRELATION
• Theory & Methods: Rank Correlation — an Alternative Measure

Cites work

• A NEW MEASURE OF RANK CORRELATION
• A unified local ratio approximation of node-deletion problems
• Node-and edge-deletion NP-complete problems
• On the shortest spanning subtree of a graph and the traveling salesman problem

This page was built for publication: Rank correlation coefficient correction by removing worst cases

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