On the comparison of the Spearman and Kendall metrics between linear orders.

DOI10.1016/S0012-365X(98)00076-4zbMath1062.62108WikidataQ127370774 ScholiaQ127370774MaRDI QIDQ1584441

Bernard Monjardet

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Combinatorics of partially ordered sets (06A07) Nonparametric inference (62G99)

Related Items (3)

Metrizable preferences over preferences ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Is the preference of the majority representative?

Cites Work

• Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges and the totally ordered pairs which maximize \(| Rho\)- Tau\(|)\)
• Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
• Concordance between two linear orders: The Spearman and Kendall coefficients revisited
• Betweenness, orders and interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the comparison of the Spearman and Kendall metrics between linear orders.