Concordance between two linear orders: The Spearman and Kendall coefficients revisited
From MaRDI portal
Publication:1378870
DOI10.1007/s003579900013zbMath0907.62072OpenAlexW2018124215MaRDI QIDQ1378870
Publication date: 9 February 1998
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003579900013
Related Items (3)
Metrizable preferences over preferences ⋮ Concordance graphs ⋮ On the comparison of the Spearman and Kendall metrics between linear orders.
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\(|)\)
- A use for frequently rediscovering a concept
- Metric methods for analyzing partially ranked data
- The median procedure in cluster analysis and social choice theory
- Graphic Computation of Tau as a Coefficient of Disarray
- Ordinal Measures of Association
- Monotonicity of Rank Statistics in some Non–parametric: Testing Problems
- Contributions to the Theory of Rank Order Statistics: Applications of Lattice Theory
- A property of rank correlations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Concordance between two linear orders: The Spearman and Kendall coefficients revisited