ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1811.01216
  4. Cited By
Learning sparse mixtures of rankings from noisy information

Learning sparse mixtures of rankings from noisy information

3 November 2018
Anindya De
Ryan O'Donnell
Rocco A. Servedio
ArXiv (abs)PDFHTML

Papers citing "Learning sparse mixtures of rankings from noisy information"

4 / 4 papers shown
Title
Noisy population recovery in polynomial time
Noisy population recovery in polynomial time
Anindya De
M. Saks
Sijian Tang
34
17
0
24 Feb 2016
A Polynomial Time Algorithm for Lossy Population Recovery
A Polynomial Time Algorithm for Lossy Population Recovery
Ankur Moitra
M. Saks
96
33
0
06 Feb 2013
Consensus ranking under the exponential model
Consensus ranking under the exponential model
M. Meilă
K. Phadnis
Arthur Patterson
J. Bilmes
64
138
0
20 Jun 2012
Dirichlet Process Mixtures of Generalized Mallows Models
Dirichlet Process Mixtures of Generalized Mallows Models
M. Meilă
Harr Chen
81
68
0
15 Mar 2012
1