Learning mixtures of ranking Models

Advances in Neural Information Processing Systems

Volumn 3, Issue January, 2014, Pages 2609-2617

  Awasthi, Pranjal ^a   Blum, Avrim ^b   Sheffet, Or ^c   Vijayaraghavan, Aravindan ^d  

^a PRINCETON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION; POPULATION STATISTICS;

HETEROGENEOUS POPULATIONS; IDENTIFIABILITY; MALLOWS MODELS; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC MODELS; SPECIFIC PROBLEMS; TENSOR DECOMPOSITION; THEORETICAL GUARANTEES;

MIXTURES;

EID: 84937883568     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. C. L. Mallows. Non-null ranking models i. Biometrika, 44(1-2), 1957.
2. John I. Marden. Analyzing and Modeling Rank Data. Chapman & Hall, 1995.
3. Guy Lebanon and John Lafferty. Cranking: Combining rankings using conditional probability models on permutations. In ICML, 2002.
4. Thomas Brendan Murphy and Donal Martin. Mixtures of distance-based models for ranking data. Computational Statistics and Data Analysis, 41, 2003.
5. Marina Meila, Kapil Phadnis, Arthur Patterson, and Jeff Bilmes. Consensus ranking under the exponential model. Technical report, UAI, 2007.
6. Ludwig M. Busse, Peter Orbanz, and Joachim M. Buhmann. Cluster analysis of heterogeneous rank data. In ICML, ICML '07, 2007.
7. Bhushan Mandhani and Marina Meila. Tractable search for learning exponential models of rankings. Journal of Machine Learning Research - Proceedings Track, 5, 2009.
8. Tyler Lu and Craig Boutilier. Learning mallows models with pairwise preferences. In ICML, 2011.
9. Joel Oren, Yuval Filmus, and Craig Boutilier. Efficient vote elicitation under candidate uncertainty. JCAI, 2013.
10. H Peyton Young. Condorcet's theory of voting. The American Political Science Review, 1988.
11. Persi Diaconis. Group representations in probability and statistics. Institute of Mathematical Statistics, 1988.
12. Mark Braverman and Elchanan Mossel. Sorting from noisy information. CoRR, abs/0910.1191, 2009.
13. Marina Meila and Harr Chen. Dirichlet process mixtures of generalized mallows models. In UAI, 2010.
14. Sanjoy Dasgupta. Learning mixtures of gaussians. In FOCS, 1999.
15. Sanjeev Arora and Ravi Kannan. Learning mixtures of arbitrary gaussians. In STOC, 2001.
16. Dimitris Achlioptas and Frank McSherry. On spectral learning of mixtures of distributions. In COLT, 2005.
17. Adam Tauman Kalai, Ankur Moitra, and Gregory Valiant. Efficiently learning mixtures of two gaussians. In STOC, STOC '10, 2010.
18. A. Moitra and G. Valiant. Settling the polynomial learnability of mixtures of gaussians. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, 2010.
19. Anima Anandkumar, Rong Ge, Daniel Hsu, Sham M. Kakade, and Matus Telgarsky. Tensor decompositions for learning latent variable models. CoRR, abs/1210.7559, 2012.
20. Animashree Anandkumar, Daniel Hsu, and Sham M. Kakade. A method of moments for mixture models and hidden markov models. In COLT, 2012.
21. Daniel Hsu and Sham M. Kakade. Learning mixtures of spherical gaussians: moment methods and spectral decompositions. In ITCS, ITCS '13, 2013.
22. Santosh Vempala and Grant Wang. A spectral algorithm for learning mixture models. J. Comput. Syst. Sci., 68(4), 2004.
23. Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan. Smoothed analysis of tensor decompositions. In Symposium on the Theory of Computing (STOC), 2014.
24. M. G. Kendall. Biometrika, 30(1/2), 1938.
25. Aditya Bhaskara, Moses Charikar, and Aravindan Vijayaraghavan. Uniqueness of tensor decompositions with applications to polynomial identifiability. CoRR, abs/1304.8087, 2013.
26. Naveen Goyal, Santosh Vempala, and Ying Xiao. Fourier pca. In Symposium on the Theory of Computing (STOC), 2014.
27. R.P. Stanley. Enumerative Combinatorics. Number v. 1 in Cambridge studies in advanced mathematics. Cambridge University Press, 2002.