Speed-up for the expectation-maximization algorithm for clustering categorical data

Journal of Global Optimization

Volumn 37, Issue 4, 2007, Pages 513-525

  Jollois, F X ^a   Nadif, M ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Acceleration; Categorical data; Clustering; Expectation maximization algorithm; Mixture model

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; DATABASE SYSTEMS; MATHEMATICAL MODELS;

CATEGORICAL DATA; EXPECTATION-MAXIMIZATION ALGORITHMS; MIXTURE MODELS;

ALGORITHMS;

EID: 33847320688     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9059-3     Document Type: Article

References (16)

1. Celeux, G., Govaert, G.: A classification EM algorithm for clustering and two stochastic versions. Comput. Stat. Data Anal. 14, 315-332 (1992)
2. Cheeseman, P., Stutz, J.: Bayesian classification (autoclass): theory and results. In: Fayyad, U., Pitesky-Shapiro, O., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining. pp. 61-83 AAAI Press, CA (1996)
3. Day, N.E.: Estimating the components of a mixture of normal distributions. Biometrika 56, 464-474 (1969)
4. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood for incomplete data via the EM algorithm. J. Roy. Stat. Soc. 39(B), 1-38 (1977)
5. Domingos, P., Pazzani, M.: Beyond independence: Conditions for the optimality of the simple bayesian classifier. Mach. Learn. 29, 103-130 (1997)
6. Govaert, G., Nadif, M.: Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data. Comput. Stat. Data Anal. 23, 65-81 (1996)
7. Jamshidian, M., Jennrich, R.: Conjugate gradient acceleration of the EM algorithm. J. Am. Stat. Associ 88(421), 221-228 (1993)
8. Lazarfeld, P., Henry, N.: Latent Structure Analysis. Houghton Mifflin, Boston (1968)
9. McCallum, A., Nigam, K., Ungar, L.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Ramakrishnan, R., Stolfo, S. (eds.) Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 169-178. ACM, NewYork (2000)
10. McLachlan, G., Peel, D.: Finite Mixture Models. Wiley, New-York (2000)
11. Meilijson, I.: A fast improvement to the EM algorithm on its own terms. J. Roy. Stat. Soc. Ser B 51(1), 127-138 (1989)
12. Meng, X.-L., van Dyk, D.: The EM algorithm - an old folksong sung to a fast new tune (with discussion). J. Royal Stat. Soc. Ser B 59, 511-567 (1997)
13. Moore, A.: Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Kearns, M.S., Solla, S.A., Cohn, D.A. (eds.) Advances in Neural Information Processing Systems 11: Proceedings of the 1998 Conference, pp. 543-549. MIT Press, Cambridge, MA (1999)
14. Neal, R., Hinton, G.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M. (ed.) Learning in Graphical Models, pp. 355-371. Kluwer Academic Publishers, Dordrecht (1998)
15. Symons, M.: Clustering criteria by multivariate normal mixtures. Biometrics 37, 35-43 (1981)
16. Thiesson, B., Meek, C., Heckerman, D.: Accelerating EM for large databases. Mach. Learn. 45, 279-299 (2001)