When the data consists of a set of objects described by a set of variables, we have recently proposed a new mixture model which takes into account the block clustering problem on the both sets and have developed the block CEM algorithm. In this paper, we embed the block clustering problem of contingency table in the mixture approach. In using a Poisson model and adopting the classification maximum likelihood principle we perform an adapted version of block CEM. We evaluate its performance and compare it to a simple use of CEM applied on the both sets separately. We present detailed experimental results on simulated data and we show the interest of this new algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Nadif, M., & Govaert, G. (2005). A comparison between block CEM and two-way CEM algorithms to cluster a contingency table. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3721 LNAI, pp. 609–616). https://doi.org/10.1007/11564126_64
Mendeley helps you to discover research relevant for your work.