Gaussian Mixture Model with local consistency

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 512-517

  Liu, Jialu ^a   Cai, Deng ^a   He, Xiaofei ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; IMAGE SEGMENTATION; LARGE SCALE SYSTEMS; MAXIMUM PRINCIPLE;

CONDITIONAL PROBABILITY DISTRIBUTIONS; DATA CLUSTERING METHODS; EXPECTATION-MAXIMIZATION ALGORITHMS; GAUSSIAN COMPONENTS; GAUSSIAN MIXTURE MODEL; KULLBACK LEIBLER DIVERGENCE; MANIFOLD STRUCTURES; OBJECTIVE FUNCTIONS;

GAUSSIAN DISTRIBUTION;

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

References (19)

1. Belkin, M., and Niyogi, P. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems 14.
2. Belkin, M.; Niyogi, P.; and Sindhwani, V. 2006. Manifold reg-ularization: A geometric framework for learning from examples. Journal of Machine Learning Research 7:2399-2434.
3. Bishop, C. M. 2006. Pattern Recognition and Machine Learning.
4. Breiman, L.; Friedman, J.; Stone, C. J.; and Olshen, R. A. 1984. Classification and Regression Trees. Chapman & Hall/CRC.
5. Cai, D.; He, X.; and Han, J. 2005. Document clustering using locality preserving indexing. IEEE Transactions on Knowledge and Data Engineering 17(12): 1624-1637.
6. Cai, D.; He, X.; and Han, J. 2010. Locally consistent concept factorization for document clustering. IEEE Transactions on Knowledge and Data Engineering To appear.
7. Cai, D.; Wang, X.; and He, X. 2009. Probabilistic dyadic data analysis with local and global consistency. In ICML'09.
8. Chung, F R. K. 1997. Spectral Graph Theory, volume 92 of Regional Conference Series in Mathematics.
9. Dempster, A. P.; Laird, N. M.; and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological).
10. Duda, R. O.; Hart, P. E.; and Stork, D. G. 2000. Pattern Classification. Wiley-lnterscience Publication.
11. He, X.; Cai, D.; Shao, Y.; Bao, H.; and Han, J. 2010. Laplacian regularized gaussian mixture model for data clustering. IEEE Transactions on Knowledge and Data Engineering To appear.
12. Jain, A. K.; Murty, M. N.; and Flynn, P. J. 1999. Data clustering: a review. ACM Comput. Sum.
13. Lovasz, L., and Plummer, M. 1986. Matching Theory. North Holland, Budapest: Akadémiai Kiadó.
14. Ng, A. Y.; Jordan, M.; and Weiss, Y. 2001. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14.
15. Roweis, S., and Saul, L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323-2326.
16. Shi, J., and Malik, J. 1997. Normalized cuts and image segmentation. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on.
17. Tenenbaum, J.; de Silva, V.; and Langford, J. 2000. A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319-2323.
18. Zhou, D.; Bousquet, O.; Lai, T.; Weston, J.; and Scho′lkopf, B. 2003. Learning with local and global consistency. In NIPS 16.
19. Zhu, X., and Lafferty, J. 2005. Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning. In ICML '05: Proceedings of the 22nd international conference on Machine learning, 1052-1059.