On learning mixture models for permutations

DOI10.1145/2688073.2688111zbMATH Open1366.68234OpenAlexW2102928096MaRDI QIDQ2989017FDOQ2989017

Authors: Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi 

Publication date: 19 May 2017

Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2688073.2688111

Recommendations

• Sampling and learning Mallows and generalized Mallows models under the Cayley distance
• Mallows and generalized Mallows model for matchings
• On reconstructing a hidden permutation
• Recursive inversion models for permutations
• Learning Arbitrary Statistical Mixtures of Discrete Distributions

zbMATH Keywords

permutationsmixture modelsranking aggregationMallows models

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial probability (60C05)

Cited In (7)

• Learning Permutations with Exponential Weights
• Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
• Uncovering the riffled independence structure of ranked data
• Extending permutation conditional inference to unconditional ones
• Minimal model of permutation symmetry in unsupervised learning
• Permutational Rademacher Complexity
• Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments

This page was built for publication: On learning mixture models for permutations

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