Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Ensembles of Partitions via Data Resampling
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
An information-theoretic analysis of hard and soft assignment methods for clustering
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Emotion recognition from speech via boosted Gaussian mixture models
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Model-based subspace clustering of non-Gaussian data
Neurocomputing
Identifying topical authorities in microblogs
Proceedings of the fourth ACM international conference on Web search and data mining
Scene image clustering based on boosting and GMM
Proceedings of the Second Symposium on Information and Communication Technology
Spectral clustering for time series
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
| Hi-index | 0.00 |
Boosting is an effecient method to improve the classification performance. Recent theoretical work has shown that the boosting technique can be viewed as a gradient descent search for a good fit in function space. Several authors have applied such viewpoint to solve the density estimation problems. In this paper we generalize such framework to a specific density model – Gaussian Mixture Model (GMM) and propose our boosting GMM algorithm. We will illustrate the applications of our algorithm to cluster ensemble and short-term traffic flow forecasting problems. Experimental results are presented showing the effectiveness of our approach.