Generalized permutation polytopes and exploratory graphical methods for ranked data

DOI10.1214/aos/1176349265zbMath0810.62004OpenAlexW2092582493MaRDI QIDQ1314462

Gerald L. Thompson

Publication date: 6 April 1995

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176349265

zbMATH Keywords

Kendall's taucoset spacesystem of linear equationsSpearman's rhopermutation polytopefully ranked datageneralized permutation polytopepartially ranked datasymmetric group of permutations

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Symmetry properties of polytopes (52B15) Graphical methods in statistics (62A09)

Related Items (13)

Multidimensional medians arising from geodesics on graphs ⋮ On rankings generated by pairwise linear discriminant analysis of \(m\) populations ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Median constrained bucket order rank aggregation ⋮ Informative priors for the consensus ranking in the Bayesian Mallows model ⋮ Model-based clustering for multivariate partial ranking data ⋮ Unnamed Item ⋮ Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Geometric representation of association between categories ⋮ A generative model for rank data based on insertion sort algorithm ⋮ Efficient algorithms using subiterative convergence for Kemeny ranking problem ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis

This page was built for publication: Generalized permutation polytopes and exploratory graphical methods for ranked data