Matrix analysis
The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Embedding tree metrics into low dimensional Euclidean spaces
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Estimating a mixture of two product distributions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning mixtures of arbitrary gaussians
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Random projection in dimensionality reduction: applications to image and text data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Greedy EM Algorithm for Gaussian Mixture Learning
Neural Processing Letters
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures & Algorithms
Efficient greedy learning of Gaussian mixture models
Neural Computation
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient PAC Algorithm for Reconstructing a Mixture of Lines
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
When Can Two Unsupervised Learners Achieve PAC Separation?
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences - Special issu on PODS 2001
Fast and accurate text classification via multiple linear discriminant projections
The VLDB Journal — The International Journal on Very Large Data Bases
Generative model-based clustering of directional data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Experiments with random projections for machine learning
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal Time Bounds for Approximate Clustering
Machine Learning
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
A spectral algorithm for learning mixture models
Journal of Computer and System Sciences - Special issue on FOCS 2002
Almost autonomous training of mixtures of principal component analyzers
Pattern Recognition Letters
Genetic-Based EM Algorithm for Learning Gaussian Mixture Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the impossibility of dimension reduction in l1
Journal of the ACM (JACM)
On Learning Mixtures of Heavy-Tailed Distributions
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Learning mixtures of product distributions over discrete domains
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Error bounds for correlation clustering
ICML '05 Proceedings of the 22nd international conference on Machine learning
The space complexity of pass-efficient algorithms for clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The uniqueness of a good optimum for K-means
ICML '06 Proceedings of the 23rd international conference on Machine learning
An investigation of computational and informational limits in Gaussian mixture clustering
ICML '06 Proceedings of the 23rd international conference on Machine learning
Embeddings of surfaces, curves, and moving points in euclidean space
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Linear manifold clustering in high dimensional spaces by stochastic search
Pattern Recognition
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
The Journal of Machine Learning Research
A rigorous analysis of population stratification with limited data
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Video summarization at Brno University of Technology
Proceedings of the international workshop on TRECVID video summarization
Learning intersections of halfspaces with a margin
Journal of Computer and System Sciences
Automatic cognitive load detection from speech features
OZCHI '07 Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces
A discriminative framework for clustering via similarity functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Data spectroscopy: learning mixture models using eigenspaces of convolution operators
Proceedings of the 25th international conference on Machine learning
Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Incomplete Statistical Information Fusion and Its Application to Clinical Trials Data
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Clustering with Interactive Feedback
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Video summarization at Brno university of technology
TVS '08 Proceedings of the 2nd ACM TRECVid Video Summarization Workshop
Approximate clustering without the approximation
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Robust PCA and clustering in noisy mixtures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Initializing Partition-Optimization Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Multiple pass streaming algorithms for learning mixtures of distributions in Rd
Theoretical Computer Science
Multi-view clustering via canonical correlation analysis
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Collapsed variational Dirichlet process mixture models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Foundations and Trends® in Theoretical Computer Science
Semi-supervised statistical region refinement for color image segmentation
Pattern Recognition
Are there local maxima in the infinite-sample likelihood of Gaussian mixture estimation?
COLT'07 Proceedings of the 20th annual conference on Learning theory
Separating populations with wide data: a spectral analysis
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficiently learning mixtures of two Gaussians
Proceedings of the forty-second ACM symposium on Theory of computing
Compressed fisher linear discriminant analysis: classification of randomly projected data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
The Journal of Machine Learning Research
A fast algorithm for robust mixtures in the presence of measurement errors
IEEE Transactions on Neural Networks
Exploiting tag and word correlations for improved webpage clustering
SMUC '10 Proceedings of the 2nd international workshop on Search and mining user-generated contents
On the distance concentration awareness of certain data reduction techniques
Pattern Recognition
An entropy weighting mixture model for subspace clustering of high-dimensional data
Pattern Recognition Letters
Proceedings of the twenty-seventh annual symposium on Computational geometry
Optimal time bounds for approximate clustering
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Experiments with random projection
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
A two-round variant of EM for Gaussian mixtures
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Communications of the ACM
A Topological View of Unsupervised Learning from Noisy Data
SIAM Journal on Computing
Gossip-Based greedy gaussian mixture learning
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
PAC learning axis-aligned mixtures of gaussians with no separation assumption
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Improving random projections using marginal information
COLT'06 Proceedings of the 19th annual conference on Learning Theory
MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
The spectral method for general mixture models
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On spectral learning of mixtures of distributions
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Toward privacy in public databases
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Maximum likelihood estimation of Gaussian mixture models using stochastic search
Pattern Recognition
A tight bound on the performance of Fisher's linear discriminant in randomly projected data spaces
Pattern Recognition Letters
A spectral algorithm for learning Hidden Markov Models
Journal of Computer and System Sciences
Leveraging Social Bookmarks from Partially Tagged Corpus for Improved Web Page Clustering
ACM Transactions on Intelligent Systems and Technology (TIST)
Effective principal component analysis
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Spectral learning of latent-variable PCFGs
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Random direction divisive clustering
Pattern Recognition Letters
Learning mixtures of spherical gaussians: moment methods and spectral decompositions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Clustering under approximation stability
Journal of the ACM (JACM)
Towards large scale continuous EDA: a random matrix theory perspective
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Learning mixtures of arbitrary distributions over large discrete domains
Proceedings of the 5th conference on Innovations in theoretical computer science
A novel clustering algorithm based Gaussian mixture model for image segmentation
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Recursive Bayesian fire recognition using greedy margin-maximizing clustering
Machine Vision and Applications
A comparative study of novel robust clustering algorithms
Intelligent Data Analysis
| Hi-index | 0.02 |
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with weak performance guarantees. We present the first provably correct algorithm for learning a mixture of Gaussians. The algorithm is very simple and returns the true centers of the Gaussians to within the precision specified by the user, with high probability. It runs in time only linear in the dimension of the data and polynomial in the number of Gaussians.