. Tns, Tableau 5 x 10 réordonné selon les parti,ti,ons obtenus aaec Croeuc. 11023684579 -0.78 -0.82 -1.35 -0.66 -1

I. Illustration-sur-un-exemple-pour-illustrer-le-fonctionnement-de and . Croeuc, nous avons choisi de l'appliquer sur un exemple. Les données initiales, standardisées, sont présentées dans Ie tableau 5.1, et de manière réordonnée selon les partitions en lignes et en colonnes obtenues a,vec Croeuc dans le tableau 5.2. On peut noter qtJeW,no,: 13.737329 est le critère minimal que I'on a obtenu

. Minr, Kr +2) : -12 + | MaxR(Kr*I):-12

. Dans-le-cadre-de-ce-travail, et afin de pouvoir comparer les algorithmes utilisés en terme de vitesse, nous avons donc du tous les écrire. Pour ceci, après avoir utilisé C+ + pendant quelques temps, nous nous sommes intéressé à un langage de type matriciel, nommé IML, avec le logiciel de statistiques ,9.A.9 System (SAS Institute)

A. Petrov, B. Et-csaki, and F. , Information Theory and an Extension of the Maximum Likelihood Principle, éditeurs, Second Intemational Symposium on Information Theory, pp.267-295

P. Arabie, A. Boorman, and P. Et-levitt, Construction Blockmodels: how and why, J ournal of Mathematical Psychology, vol.7, pp.2-63, 1978.
DOI : 10.1016/0022-2496(78)90034-2

G. H. Ball and D. J. Hall, ISODATA, an Iterative Method of Multivariate Analysis and Pattern Recognit\on. Behaui,or Sc'ience, p.53, 1967.

J. Banfield and A. Et-raftery, Model-Based Gaussian and Non-Gaussian Clustering, Biometrics, vol.49, issue.3, pp.803-821, 1993.
DOI : 10.2307/2532201

Y. Bencheikh, Classification automatique et modèles, Thèse de Doctorat, 1992.

J. Bezdek, Pattern Recognition with Fuzzy Objecti,ue Function Algorithms, 1981.
DOI : 10.1007/978-1-4757-0450-1

C. Biernacki, G. Celeux, and G. Et-govaert, Strategies for getting likelihood in mixture models, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072333

C. Biernacki, G. Celeux, and G. Et-govaert, Assessing a Mixture Model for Clustering with the Integrated Classification Likelihood, IEEE Transactions on Pattern Analy sis and M achine Intellig ence, vol.22, issue.7, pp.779-786, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00073163

H. Bock, Simultaneous Clustering of Objects and VariaÔles, pp.187-203

H. Bozdogan, Multi-Sample Cluster Analgsis and Approaches to Validitg Studi,es in Clustering Indiuiduals, Thèse de Doctorat, 1981.

H. Bozdogan, Determining the Number of Component Clusters in the Standard Multivariate Normal Mixture Model Using Model-Selection Criteria, 1983.

P. Bradley, U. Fayyad, and C. Et-reina, Scaling EM (Expectation-Maximization) Clustering to Large Databases, 1998.

M. Broniatowski, G. Celeux, and J. Et-diebolt, Reconnaissance de Mélanges de Densités par un Algorithme d'Apprentissage Probabiliste, Diday et al., éditeur, Data Analysis and Informatics, pp.359-374, 1983.

M. Bzioui, Classification croisée et modèle, Thèse de Doctorat, 1999.

G. Celeux, Classification et modèles Reuue de statistique appliquée Celeux, G. Modèles probabilistes en classification éditeurs, Modèles pour I'analyse de données multidimensionnelles, Economica, vol.4, pp.43-58, 1988.

G. Celeux and J. Et-diebolt, The SEM Algorithm: a Probabilistic Teacher Algorithm Derived from the EM Algorithm for the Mixture Problem, Computati,onal Statistics Quaterly, vol.2, pp.73-82, 1985.

G. Celeux and J. Et-diebolt, A Stochastic Approximation Type EM Algorithm for the Mixture Problem. Stochasti,cs and Stochasti,cs Reportes, pp.779-813
URL : https://hal.archives-ouvertes.fr/inria-00075178

G. Celeux and G. Et-govaert, Clustering criteria for discrete data and latent class models, Journal of Classification, vol.4, issue.4, pp.157-176, 1991.
DOI : 10.1007/978-94-009-5564-6

URL : https://hal.archives-ouvertes.fr/inria-00075437

G. Celeux and G. Et-govaert, A classification EM algorithm for clustering and two stochastic versions, Computational Statistics & Data Analysis, vol.14, issue.3, pp.375-332, 1992.
DOI : 10.1016/0167-9473(92)90042-E

URL : https://hal.archives-ouvertes.fr/inria-00075196

G. Celeux and G. Et-govaert, Comparison of the mixture and the classification maximum likelihood in cluster analysis, Journal of Statistical Computation and Simulation, vol.2, issue.3-4, pp.27-46, 1993.
DOI : 10.2307/2530520

URL : https://hal.archives-ouvertes.fr/inria-00075045

G. Celeux and G. Et-govaert, Gaussian Parsimonious Clustering Models. Pattern Recogni ,tion, pp.7-8
DOI : 10.1016/0031-3203(94)00125-6

URL : https://hal.archives-ouvertes.fr/inria-00074643

P. Cheeseman, J. Et-stutz, U. Fayyad, G. Pitesky-shapiro, and R. Et-uthurusamy, Bayesian Classification (AutoClass): Theory and Results, éditeurs, Aduances in Knowledge Discouery and Data Mini,ng, pp.61-83, 1996.

D. Chickering and D. Et-heckerman, Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables, Machine Learning, pp.181-212

N. E. Day, Estimating the components of a mixture of normal distributions, Biometrika, vol.56, issue.3, pp.464-474
DOI : 10.1093/biomet/56.3.463

A. P. Dempster, N. M. Laird, and D. B. Et-rubin, Marcimum Likelihood for Incomplete Data via the EM Algorithm, Joumal of the Royal Statistical Society, issue.B, pp.3-4, 1977.

E. Diday, Une Nouvelle Méthode en Classification Automatique et Reconnaisance des Formes, p.97
DOI : 10.1051/ro/197206v300611

URL : https://www.rairo-ro.org/articles/ro/pdf/1972/03/ro197206V300611.pdf

E. Diday, Classification automatique séquentielle pour grands tableaux. RAIRO Intelli,gnece Artificielle et Reconna'i,ssance des Formes, 1975.

E. Diday, A. Schroeder, and Y. Et-ok, The Dynamic Clusters Method in Pattern Recognition, Proceedings of IFIP Congress, p.974

D. Duffy and A. Quiroz, A permutation-based algorithm for block clustering, Journal of Classification, vol.82, issue.3, pp.65-91, 1991.
DOI : 10.1007/978-3-642-61568-9

J. C. Dunn, A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters, Journal of Cybernetics, vol.3, issue.3, pp.32-57, 1974.
DOI : 10.1080/01969727308546046

B. Everitt, An Introduction to Latent Vari,ables Models, 1984.

W. Fischer, Clustering and Aggregation in Economics, 1969.

E. W. Forgy, Cluster Analysis of Multivariate Data: Efficiency versus Interpretability Model s, Biometrics, issue.3, pp.6-768, 1965.

C. Fraley, A. E. Et-raftery, and . Mclust, Software for Model-Based Cluster and Discriminant Analysis, 1999.

H. Friedman and J. Et-rubin, On Some Invariant Criterion for Grouping Data, Journal of the American Statistical Associ, pp.62-7967

G. Govaert, Algorithme de Classification d'un Tableau de Contingence, Premières journées Internationales Analyse des Données et Informatique, pp.487-500, 1977.

G. Govaert, Classification Croisée, Thèse d'Etat, 1983.

G. Govaert, Classification Binaires et Modèles, pp.67-81, 1990.

G. Govaert, Simultaneous Clustering of Rows and Columns, Control and Cybernetics, vol.24, pp.437-458, 1995.

G. Govaert and M. Et-nadif, Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data, Computational Statistics & Data Analysis, vol.23, issue.1, pp.65-81, 1996.
DOI : 10.1016/S0167-9473(96)00021-7

G. Govaert and M. Et-nadif, Block clustering on continuous data, Proc. of the Workshop on Clustering High Dimensional Data and its applications at the Second SIAM international Conference on Data Mi,ning, pp.7-13, 2002.

G. Govaert and M. Et-nadif, Clustering with block mixture models, Pattern Recognition, vol.36, issue.2, pp.463-510, 2003.
DOI : 10.1016/S0031-3203(02)00074-2

S. Guha, R. Rastogi, and K. Et-shim, CURE: an efficient clustering algorithm for large databases, Proceedings of ACM SIGMOD Intemational Conference on Management of Data, pp.73-84, 1998.

M. Gyllenberg, T. Koski, and M. Et-verllaan, Classification of Binary Vectors by Stochastic Complexity, Institute for Applied Mathematics, 1994.
DOI : 10.1006/jmva.1997.1687

J. Han and M. Et-kamber, Data Mini,ng : Concepts and Techniques, 2001.

J. Hartigan, Direct Clustering of a Data Matrix, Journal of the American Statistical Association, vol.27, issue.2, pp.123-129
DOI : 10.1080/01621459.1963.10500845

J. Hartigan, Classification and Clustering, Journal of Marketing Research, vol.18, issue.4, 1975.
DOI : 10.2307/3151350

J. Hartigan, Modal Blocks in Dentition of West Coast Mammals, Systematic Zoology, vol.25, issue.2, pp.149-160, 1976.
DOI : 10.2307/2412741

J. Hartigan, M. A. Wong, and K. Algorithm, Algorithm AS 136: A K-Means Clustering Algorithm, Applied Statistics, vol.28, issue.1, pp.100-108, 1979.
DOI : 10.2307/2346830

. Hathaway, Another interpretation of the EM algorithm for mixture distributions, Statistics & Probability Letters, vol.4, issue.2, pp.155-176, 1986.
DOI : 10.1016/0167-7152(86)90016-7

Z. S. Huang, A Fast Clustering Algorithm to Cluster very large categorical data sets in Data Mining, Research Issues on Data Mining and Knowledg e Dis cou ery, issue.7, p.997

L. Hunt, Clustering using fi,nite mirtures models, Thèse de Doctorat, 1996.

A. Jennings, A sparse matrix shema for the computer analysis of, International J O U RN A L ol C omputer M ethematics, vol.2, p.21, 1968.

F. Jollois and M. Et-nadif, Clustering large categorical data. Dans Ad,uances in Knowledge and, Data Mining : 6th Pacific Asia Conference: Proceedings / PAKDD 2002, 6-8 Mai, pp.257-263, 2002.
DOI : 10.1007/3-540-47887-6_25

F. Jollois, M. Nadif, and G. Et-govaert, Assessing the Number of Clusters of the Latent Class Model, Classificati,on, Clustering, and Data Analysis: Recent Aduances and Applicati,ons, pp.139-146, 2002.
DOI : 10.1007/978-3-642-56181-8_15

F. Jollois, M. Nadif, G. Et-govaert, and R. Ca, Classification croisée sur des données binaires de grande taille, Ertraction et Gesti,on des Conna'issances, pp.7-9, 2003.

G. Karypis, H. Eui-hong, and V. Et-kumar, Chameleon: hierarchical clustering using dynamic modeling, Computer, vol.32, issue.8, pp.68-75, 1999.
DOI : 10.1109/2.781637

G. Lance and W. Williams, A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems, The Computer Journal, vol.9, issue.4, pp.373-380, 1967.
DOI : 10.1093/comjnl/9.4.373

P. F. Lazafield, A conceptuel introduction to latent structure analysis, Chapitre Mathematical Thinking in the Social Sciences, 1954.

P. F. Lazarfeld and N. W. Henry, Latent Structure Analysis-Houghton Miffiin, 1968.

R. Little and D. Et-rubin, Statistical Analysi,s with Missing Data, 1987.
DOI : 10.1002/9781119013563

URL : https://deepblue.lib.umich.edu/bitstream/handle/2027.42/86948/j.1467-9876.2011.00763.x.pdf%3Bjsessionid%3D9F4E40A0121497171B7FCBB5E4722167?sequence%3D1

J. Macqueen, Some Methods for Classification and Analysis of Multivariate Observations, Proc. ïth Berkeley Symposium on Mathematical Statistics and Probability, pp.281-297, 1967.

F. Marchetti, Contribution ù Ia classi,fication de données binaires et qualitatiues, Thèse de Doctorat, 1989.

F. Marchotorchino, Block seriation problems, a unified approach Applied Stochastic Models and Data Analysis, pp.73-91, 1987.

A. Mccallum, K. Nigam, L. H. Et-ungar, R. Ramakrishnan, and S. Et-stolfo, Efficient clustering of high-dimensional data sets with application to reference matching, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.169-178, 2000.
DOI : 10.1145/347090.347123

G. Mclachlan, K. Et-basford, and . Mi, rture Models, Inference and Applicoti,ons to CIustering, 1989.

G. Mclachlan and T. Et-krishnan, The EM Algorithm and Ertensi,ons, 1997.

G. J. Mclachlan and D. Et-peel, User's guide to EMMIX-Version 1.0. Rapport Technique, 1998.

A. Moore, M. S. Kearns, S. A. Solla, and . Et-cohn, Very Fast EM-Based Mixture Model Clustering Using Multiresolution kd-Trees, éditeurs, Aduances i,n Neural Information Processing Systems 11: Proceed,ings of the 1998 Conference, pp.543-549, 1999.

M. Nadif, Classification automatique et données manquantes, Thèse de Doctorat, 1991.

M. Nadif and G. Et-govaert, Binary clustering with missing data Applied Stochastic Models and Data Analysis, pp.269-278, 1993.

M. Nadif, G. Govaert, and F. Et-jollois, A Hybrid system for identifying homogenous blocks in large data sets. Dans ,Second Euro-Japanese Workshop on Stochastic Risk Modelling for Finance, Insurance, Producti,on and Reliability, 16-19 septembre, pp.324-333, 2002.

M. Nadif and F. Et-marchetti, Classification de Données Qualitatives et Modèles Reuue de Statistique Appliquée, XLI(I), pp.55-69

R. Neal and G. Et-hinton, A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants, éditeur, Learning in Graphical Models, pp.355-371, 1998.
DOI : 10.1007/978-94-011-5014-9_12

S. J. Nowlan, Soft Competitiue Adaptation: Neural Networle Learning Algorithms Based on Fitting Statistical Mirtures, Thèse de Doctorat, 1991.

K. Pearson, Contribution to the Mathematic Theory of Evolution, Philo. Trans. ^9oc, vol.185, p.1894

D. J. Rae, MICKA, a FORTRAN IV iterative k-means Cluster Analysis Program. B ehau ourial S cience, pp.423-424

N. Ralambondrainy, Etudes des données qualitatives par les méthodes typologiques. Dans Actes au congrès de I'Association Françai,se de Marketting, 1988.

R. Redner and H. Walker, Mixture Densities, Maximum Likelihood and the EM Algorithm, SIAM Review, vol.26, issue.2, pp.95-239, 1984.
DOI : 10.1137/1026034

C. Robardet, Contribution ù, la classification superu'isée: proposition d'une méthode de bi-parti,tionnement, Thèse de Doctorat, 2002.

M. Sato, Fast Learning of On-Line EM Algorithm, Rapport Technique, ATR Human Information Processing Research Laboratories, 1999.

M. Sato and S. Et-ishii, On-line EM Algorithm for the Normalized Gaussian Network, Neural Computation, vol.39, issue.2, pp.407-432, 2007.
DOI : 10.1162/089976698300016963

J. Schafer, Analysis of Incomplete Multi,uari,ate Data, 1997.

A. Schroeder, Analyse d'un Mélange de Distributions de Probabilités de Même Type, pp.39-62, 1976.

A. J. Scott and M. J. Symons, Clustering Methods Ba"sed on Likelihood Ratio Criteria, Biometrics 797J Symons, M. J. Clustering Criteria by Multivariate Normal Mixtures. Biometrics, vol.27, issue.37, pp.387-39735, 1981.
DOI : 10.2307/2529003

M. A. Tanner, C. Meek, and D. Et-heckerman, Tools for Statistical Inference Lecture Notes i,n Statisti,cs Tewarson, R. Sorting and ordering sparse linear systems Accelerating EM for Large Databases, 1971.

R. Tibshirani, T. Hastie, M. Eisen, D. Ross, D. Botstein et al., Clustering methods for the analysis of DNA microarray data, 1999.

G. C. Wei and M. A. Tanner, A Monte Carlo Implementation of the EM Algorithm and the Poor Man's Data Augmentation Algorithms. Joumal of the American S t ati sti, cal A s s o ci ati

J. H. Wolfe, PATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSIS, Multivariate Behavioral Research, vol.5, issue.3, pp.329-350, 1970.
DOI : 10.1207/s15327906mbr0503_6

M. A. Wong, T. Zhang, R. Ramakrishnan, and M. Et-livng, A Hybrid Clustering Method for Identifying High Density Clusters BIRCH: an efficient data clustering method for very large databases, Proceedings of the 1996 ACM SIGMOD Intemational Conference on Management of Data, pp.84-847, 1996.