论文信息 - A spectral algorithm for learning mixture models - 字舞流文

A spectral algorithm for learning mixture models

Santosh S. Vempala | Grant Wang | S. Vempala | Grant J. Wang

[1] Santosh S. Vempala,et al. Logconcave functions: geometry and efficient sampling algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[2] Sanjeev Arora,et al. Learning mixtures of arbitrary gaussians , 2001, STOC '01.

[3] Anna R. Karlin,et al. Spectral analysis of data , 2001, STOC '01.

[4] Santosh S. Vempala,et al. Latent Semantic Indexing , 2000, PODS 2000.

[5] Sanjoy Dasgupta,et al. A Two-Round Variant of EM for Gaussian Mixtures , 2000, UAI.

[6] Sanjoy Dasgupta,et al. Learning mixtures of Gaussians , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7] Alan M. Frieze,et al. Clustering in large graphs and matrices , 1999, SODA '99.

[8] Santosh S. Vempala,et al. Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.

[9] Miklós Simonovits,et al. Isoperimetric problems for convex bodies and a localization lemma , 1995, Discret. Comput. Geom..

[10] B. Lindsay. Mixture models : theory, geometry, and applications , 1995 .

[11] A. F. Smith,et al. Statistical analysis of finite mixture distributions , 1986 .

[12] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[13] G. Stewart. Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .