Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments
From MaRDI portal
Publication:2091836
DOI10.1214/22-AOS2185MaRDI QIDQ2091836
Publication date: 2 November 2022
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.06784
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Searching and sorting (68P10) Statistical ranking and selection procedures (62F07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Mixtures of distance-based models for ranking data
- A mixture of experts model for rank data with applications in election studies
- Realizability of a model in infinite statistics
- Mallows and generalized Mallows model for matchings
- Strong identifiability and optimal minimax rates for finite mixture estimation
- Optimal estimation of Gaussian mixtures via denoised method of moments
- The repeated insertion model for rankings: missing link between two subset choice models
- On Learning Mixture Models for Permutations
- Exploring Voting Blocs Within the Irish Electorate
- NON-NULL RANKING MODELS. I
This page was built for publication: Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments