A probabilistic analysis of EM for mixtures of separated, spherical Gaussians

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 203-226

  Dasgupta, Sanjoy ^a   Schulman, Leonard ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Clustering; Expectation maximization; Mixtures of Gaussians; Probabilistic analysis; Unsupervised learning

Indexed keywords

NEAR-OPTIMAL PRECISION; PROBABILISTIC ANALYSIS; SPHERICAL GAUSSIANS;

LEARNING ALGORITHMS; PARAMETER ESTIMATION; PROBABILISTIC LOGICS;

GAUSSIAN NOISE (ELECTRONIC);

EID: 33847128516     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In Proceedings of the 18th Conference on Learning Theory, 458-469, 2005.
2. S. Arora and R. Kannan. Learning mixtures of separated nonspherical Gaussians. Annals of Applied Probability, 15(1A):69-92, 2005.
3. C. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, New York, 1995.
4. S. Dasgupta. Learning mixtures of Gaussians. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 634-644, 1999.
5. A. Dempster, N. Laird, and D. Rubin. Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. Ser. B, 39:1-38, 1977.
6. P. Diaconis and D. Freedman. Asymptotics of graphical projection pursuit. Annals of Statistics, 12:793-815, 1984.
7. R. Duda and P. Hart. Pattern Classification and Scene Analysis. John Wiley, New York, 1973.
8. k do not cut all subsets of k + 2 points. Advances in Mathematics, 31:306-308, 1979.
9. R. Durrett. Probability: Theory and Examples. Duxbury, Belmont, California, 1996.
10. W. Feller. An Introduction to Probability Theory and its Applications, vol. II. John Wiley, New York, 1966.
11. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
12. D. Haussler. Decision-theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100:78-150, 1992.
13. M. Kearns, Y Mansour, and A. Ng. An information-theoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, 1997.
14. M. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, Massachusetts, 1994.
15. R. Redner and H. Walker. Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2): 195-239, 1984.
16. D. Titterington, A. Smith, and U. Makov. Statistical Analysis of Finite Mixture Distributions. John Wiley, London, 1985.
17. S. Vempala and G. Wang. A spectral algorithm for learning mixtures of distributions. Journal of Computer and Systems Sciences, 68(4):841-860, 2004.
18. S. Vempala, R. Kannan, and H. Salmasian. The spectral method for general mixture models. In Proceedings of the 18th Conference on Learning Theory, 2005.
19. C.F.J. Wu. On the convergence properties of the EM algorithm. Annals of Statistics, 11:95-103, 1983.
20. L. Xu and M.I. Jordan. On convergence properties of the EM algorithm for Gaussian mixtures. Neural Computation, 8:129-151, 1996.