Fetching the paper…
Reading the bibliography…
Mixture models are a fundamental tool in applied statistics and machine learning for treating data taken from multiple subpopulations.
The most predictable criterion
H. Hotelling · 1935
Earlier work this paper cites.
On the definition of a family of automata
M. P. Schützenberger · 1961
Earlier work this paper cites.
Mixture densities, maximum likelihood and the EM algorithm
R. A. Redner and H. F. Walker · 1984
Earlier work this paper cites.
Statistical analysis of finite mixture distributions
D. M. Titterington, A. F. M. Smith, and U. E. Makov · 1985
Earlier work this paper cites.
Moment matrices: applications in mixtures
B. G. Lindsay · 1989
Earlier work this paper cites.
Matrix Perturbation Theory
G. W. Stewart and Ji-Guang Sun · 1990
Earlier work this paper cites.
One sense per discourse
W. A. Gale, K. W. Church, and D. Yarowsky · 1992
Earlier work this paper cites.
Multivariate normal mixtures: a fast consistent method
B. G. Lindsay and P. Basak · 1993
Earlier work this paper cites.
Mixture models: theory, geometry and applications
B. G. Lindsay · 1995
Earlier work this paper cites.
Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency
J. T. Chang · 1996
Earlier work this paper cites.
Learning linear transformations
A. M. Frieze, M. Jerrum, and R. Kannan · 1996
Earlier work this paper cites.
Vandermonde factorization of a Hankel matrix
D. L. Boley, F. T. Luk, and D. Vandevoorde · 1997
Earlier work this paper cites.
Learning mixutres of Gaussians
S. Dasgupta · 1999
Earlier work this paper cites.
Independent component analysis: algorithms and applications
A. Hyvärinen and E. Oja · 2000
Cited alongside, same era.
Observable operator models for discrete stochastic time series
H. Jaeger · 2000
Cited alongside, same era.
Learning mixtures of arbitrary Gaussians
S. Arora and R. Kannan · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
Strong converse for identification via quantum channels
R. Ahlswede and A. Winter · 2002
Cited alongside, same era.
A spectral algorithm for learning mixtures of distributions
S. Vempala and G. Wang · 2002
Cited alongside, same era.
An elementary proof of a theorem of Johnson and Lindenstrauss
Correlational spectral clustering
M. B. Blaschko and C. H. Lampert · 2008
Later among the works it cites.
Isotropic PCA and affine-invariant clustering
S. C. Brubaker and S. Vempala · 2008
Later among the works it cites.
Learning mixtures of product distributions using correlations and independence
K. Chaudhuri and S. Rao · 2008
Later among the works it cites.
Multi-view clustering via canonical correlation analysis
K. Chaudhuri, S. M. Kakade, K. Livescu, and K. Sridharan · 2009
Later among the works it cites.
A spectral algorithm for learning hidden Markov models
D. Hsu, S. M. Kakade, and T. Zhang · 2009
Later among the works it cites.
Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
P. Q. Nguyen and O. Regev · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Dasgupta and A. Gupta · 2003
Cited alongside, same era.
On spectral learning of mixtures of distributions
D. Achlioptas and F. McSherry · 2005
Cited alongside, same era.
Learning mixtures of product distributions over discrete domains
J. Feldman, R. O’Donnell, and R. Servedio · 2005
Cited alongside, same era.
The spectral method for general mixture models
R. Kannan, H. Salmasian, and S. Vempala · 2005
Cited alongside, same era.
PAC learning mixtures of axis-aligned Gaussians with no separation assumption
J. Feldman, R. O’Donnell, and R. Servedio · 2006
Cited alongside, same era.
Learning nonsingular phylogenies and hidden Markov models
E. Mossel and S. Roch · 2006
Cited alongside, same era.
Polynomial learning of distribution families
M. Belkin and K. Sinha · 2010
Later among the works it cites.
Efficiently learning mixtures of two Gaussians
A. T. Kalai, A. Moitra, and G. Valiant · 2010
Later among the works it cites.
Settling the polynomial learnability of mixtures of Gaussians
A. Moitra and G. Valiant · 2010
Later among the works it cites.
The inverse moment problem for convex polytopes
N. Gravin, J. Lasserre, D. Pasechnik, and S. Robins · 2012
Closest in time.
A spectral algorithm for learning hidden Markov models
D. Hsu, S. M. Kakade, and T. Zhang · 2012
Closest in time.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Closest in time.