Fetching the paper…
Reading the bibliography…
This work concerns learning probabilistic models for ranking data in a heterogeneous population.
Biometrika
M. G. Kendall · 1938
Earlier work this paper cites.
Non-null ranking models i
C. L. Mallows · 1957
Earlier work this paper cites.
Condorcet’s theory of voting
H Peyton Young · 1988
Earlier work this paper cites.
Group representations in probability and statistics
Persi Diaconis · 1988
Earlier work this paper cites.
Analyzing and Modeling Rank Data
John I. Marden · 1995
Earlier work this paper cites.
Learning mixtures of gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Learning mixtures of arbitrary gaussians
Sanjeev Arora and Ravi Kannan · 2001
Earlier work this paper cites.
Cranking: Combining rankings using conditional probability models on permutations
Guy Lebanon and John Lafferty · 2002
Earlier work this paper cites.
Enumerative Combinatorics
R.P. Stanley · 2002
Earlier work this paper cites.
Mixtures of distance-based models for ranking data
Thomas Brendan Murphy and Donal Martin · 2003
Cited alongside, same era.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Cited alongside, same era.
On spectral learning of mixtures of distributions
Dimitris Achlioptas and Frank McSherry · 2005
Cited alongside, same era.
Consensus ranking under the exponential model
Marina Meila, Kapil Phadnis, Arthur Patterson, and Jeff Bilmes · 2007
Cited alongside, same era.
Cluster analysis of heterogeneous rank data
Ludwig M. Busse, Peter Orbanz, and Joachim M. Buhmann · 2007
Cited alongside, same era.
Tractable search for learning exponential models of rankings
Bhushan Mandhani and Marina Meila · 2009
Cited alongside, same era.
Settling the polynomial learnability of mixtures of gaussians
A. Moitra and G. Valiant · 2010
Later among the works it cites.
Learning mallows models with pairwise preferences
Tyler Lu and Craig Boutilier · 2011
Later among the works it cites.
Tensor decompositions for learning latent variable models
Anima Anandkumar, Rong Ge, Daniel Hsu, Sham M. Kakade, and Matus Telgarsky · 2012
Later among the works it cites.
A method of moments for mixture models and hidden markov models
Animashree Anandkumar, Daniel Hsu, and Sham M. Kakade · 2012
Later among the works it cites.
Efficient vote elicitation under candidate uncertainty
Joel Oren, Yuval Filmus, and Craig Boutilier · 2013
Later among the works it cites.
Learning mixtures of spherical gaussians: moment methods and spectral decompositions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mark Braverman and Elchanan Mossel · 2009
Cited alongside, same era.
Dirichlet process mixtures of generalized mallows models
Marina Meila and Harr Chen · 2010
Cited alongside, same era.
Efficiently learning mixtures of two gaussians
Adam Tauman Kalai, Ankur Moitra, and Gregory Valiant · 2010
Cited alongside, same era.
Daniel Hsu and Sham M. Kakade · 2013
Later among the works it cites.
Uniqueness of tensor decompositions with applications to polynomial identifiability
Aditya Bhaskara, Moses Charikar, and Aravindan Vijayaraghavan · 2013
Later among the works it cites.
Smoothed analysis of tensor decompositions
Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan · 2014
Closest in time.
Fourier pca
Naveen Goyal, Santosh Vempala, and Ying Xiao · 2014
Closest in time.