Learning mixtures of arbitrary gaussians

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 247-257

  Arora, S ^a   Kannan, R ^a  

^a Princeton University   (United States)

Author keywords

Clustering; Gaussians; Learning; Mixture distributions

Indexed keywords

HEURISTIC METHODS; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; PROBABILITY;

GAUSSIAN DISTRIBUTIONS;

LEARNING ALGORITHMS;

EID: 0034830274     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Random points in isotropic convex sets
2. A constant-factor approximation algorithm for the k-median problem
3. Learning mixtures of gaussians
4. Maximum likelihood from incomplete data via the EM algorithm
5. Estimating a mixture of two product distributions
6. Probability inequalities for sums of bounded random variables
7. Projection pursuit
8. Extensions of Lipshitz mapping into Hilbert space
9. Sampling according to the multivariate normal density
10. On a certain converse of Hölder's inequality II. Stochastic programming
11. Logarithmic concave measures with applications to stochastic programming
12. On logarithmic concave measures and functions
13. Mixture densities, maximum likelihood and the EM Algorithm
14. Random vectors in the isotropic position