Abstract
While most of the clustering procedures are aimed to construct an optimal partition of objects or, sometimes, of variables, there are other methods, called block clustering methods, which consider simultaneously the two sets and organize the data into homogeneous blocks. Recently, we have proposed a new mixture model called block mixture model which takes into account this situation. This model allows to embed simultaneous clustering of objects and variables in a mixture approach. We have considered this probabilistic model under the classification likelihood approach and we have developed a new algorithm for simultaneous partitioning based on the Classification EM algorithm. In this paper, we consider the block clustering problem under the maximum likelihood approach and the goal of our contribution is to estimate the parameters of this model. To reach this aim, we use an approximation of the likelihood and we propose an alternated-optimization algorithm to estimate the parameters, and to illustrate our approach, we study the case of binary data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bock, H. (1979) Simultaneous Clustering of Objects and Variables, in Analyse des données et Informatique. E. Diday et al. eds, Le Chesnay, INRIA, 187–203.
Besag, J.E. (1975) Statistical analysis of lattice systems. The Statistician, 24 179–195.
Celeux, G., Govaert, G. (1992) A classification EM algorithm for clustering and two stochastic versions. Computational Statistics and Data Analysis, 14 315–332.
Dempster, A., Laird, N. and Rubin, D. (1977) Mixture densities, maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39 1, 1–38.
Govaert, G. (1983) Classification croisée. Thèse d’Etat, Université Paris 6, France.
Govaert, G. (1995) Simultaneous clustering of rows and columns. Control and Cybernetics, 24 437–458.
Govaert G., Nadif M. (2001) Clustering with block mixture models. submitted.
Hartigan, J. (1975) Clustering Algorithms. New York, John Wiley.
Hathaway, R.J (1986) Another interepretation of the EM algorithm for mixture distributions. Statistics & Probability Letters, 4, 53–56.
Neal, R.M., Hinton, G.E. (1998) A view of the EM algorithm that justifies incremental, sparse, and other variants. M.I jordan, editor, Learning in Graphical Models,Kluwer Academic Press, 355–358.
Symons, M.J. (1981) Clustering criteria and multivariate normal mixtures. Biometrics, 37, 35–43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nadif, M., Govaert, G. (2002). Parameters Estimation of Block Mixture Models. In: Härdle, W., Rönz, B. (eds) Compstat. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57489-4_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-57489-4_75
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1517-7
Online ISBN: 978-3-642-57489-4
eBook Packages: Springer Book Archive