. Demanì-eré-evidente, les fonctionsélémentairesfonctionsélémentaires de classification P i ont toutes la même table de symétrie S, la table de symétrie d'une relation d'´ equivalence, et de la même manì ere, elles possèdent toutes la même

P. Soit and ?. I. , nous obtenons AgP (x, y) = ?. Il est immédiat que P i (y, x) = S(?) ?i, i ? I. Cela donne donc AgP (y, x) = S(?)

. Bibliographie-[-abf-+-95-]-r, V. Agarwala, M. Bafina, B. Farach, M. Narayanan et al., On the approximability of numerical taxonomy, 1995.

M. [. Ankerst, H. P. Breunig, J. Kriegel, and . Sander, Optics : Ordering points to identify the clustering structure, SIGMOD Conference, pp.49-60, 1999.

R. [. Alippi and . Cucchiara, Cluster partitioning in image analysis classification: a genetic algorithm approach, CompEuro 1992 Proceedings Computer Systems and Software Engineering, pp.139-144, 1992.
DOI : 10.1109/CMPEUR.1992.218520

J. [. Agrawal, D. Gehrke, P. Gunopulos, and . Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, pp.94-105, 1998.

R. [. Art, R. Gnanadesikan, and . Kettenring, Data-based metrics for cluster analysis, Utilitas Mathematica, vol.21, issue.A, pp.75-99, 1982.

L. [. Arabie and . Hubert, An overview of combinatorial data analysis. Clustering and Classification, pp.5-63, 1996.

]. M. And73 and . Anderberg, Cluster Analysis for Applications, 1973.

]. M. Arc93 and . Archoun, Modélisation prétopologique de la segmentation par croissance de régions des imagesàimages`imagesà niveaux de gris, 1993.

]. S. Arn79 and . Arnold, A test for clusters, Journal of Marketing Research, vol.16, issue.4, pp.545-551, 1979.

K. J. Arrow, Social Choice and Individual Values, 1963.

]. J. Aur82 and . Auray, ContributionàContribution`Contributionà l'´ etude des structures pauvres, 1982.

]. T. Bäc96 and . Bäck, Evolutionary Algorithms in Theory and Practice, 1996.

S. [. Bezdek, L. O. Boggavaparu, A. Hall, and . Bensaid, Genetic algorithm guided clustering, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp.34-40, 1994.
DOI : 10.1109/ICEC.1994.350046

A. [. Boubou, M. Bounekkar, and . Lamure, Classification basée sur l'agrégation d'opinions par la méthode de recuit simulé, XIVe Rencontre de la Société Francophone de Classification (SFC'07), 2007.

A. [. Boubou, D. Bounekkar, M. Tounissoux, and . Lamure, Utilisation du recuit simulé pour la recherche d'une ultramétrique optimale, XIIe Rencontre de la Société Francophone de Classification (SFC'05), 2005.

G. [. Bandfield, A. E. Celeux, C. P. Raftery, and . Robert, Inference in model-based cluster analysis, Dpto. of Statistics, 1995.

B. [. Bensmail, A. Celeux, C. Raftery, and . Robert, Inference in modelbased cluster analysis, Biometrics, vol.7, pp.1-10, 1997.

E. [. Bretrand and . Diday, A visual representation of the compatibility between an order and a dissimilarity index : the pyramids, Computational Statistics Quarterly, vol.2, issue.1, pp.31-41, 1985.

E. [. Bock and . Diday, Analysis of Symbolic Data. Exploratory methods for extracting statistical information from complex data, 2000.

R. [. Ben-dor, Z. Shamir, and . Yakhini, Clustering Gene Expression Patterns, Journal of Computational Biology, vol.6, issue.3-4, pp.281-297, 1999.
DOI : 10.1089/106652799318274

]. Z. Bel93 and . Belmandt, Manuel de prétopologie et ses applications, Hermès, 1993.

]. J. Ben73 and . L. Benzecri, Analyse des données, 1973.

P. Bertrand, Etude de la Répresentation Pyramidale, Thèse de Doctorat, 1986.

]. J. Bez74 and . Bezdeck, Numerical taxonomy with fuzzy sets, Journal of Mathematical Biology, vol.1, pp.57-71, 1974.

U. [. Bradley, C. Fayyad, and . Reina, Scaling clustering algorithms to large databases, Knowledge Discovery and Data Mining, pp.9-15, 1998.

D. [. Ball and . Hall, A clustering technique for summarizing multivariate data, Behavioral Science, vol.27, issue.2, pp.153-155, 1967.
DOI : 10.1002/bs.3830120210

Y. [. Benamou and . Kodratoff, Conceptual hierarchical ascending classification, 1986.

B. [. Barthélemy and . Leclerc, The median procedure for partitions. DI- MACS Series in, Discrete Mathematics and Theoretical Computer Science, vol.19, pp.3-33, 1995.

Y. [. Bertrand, M. Lechevallier, A. Csernel, and . Morineau, A·pyros : a pyramidal representation of data, IFCS-96, Proceedings of the fifth Conference of International Federation of Classification Societies, pp.126-128, 1996.

M. [. Babu and . Murty, Clustering with evolution strategies, Pattern Recognition, vol.27, issue.2, pp.321-329, 1994.
DOI : 10.1016/0031-3203(94)90063-9

URL : http://eprints.iisc.ernet.in/8247/1/CLUSTERING-307.pdf

S. [. Bezdeck, Fuzzy Models for Pattern Recognition, 1992.

A. [. Bandfield and . Raftery, Model-Based Gaussian and Non-Gaussian Clustering, Biometrics, vol.49, issue.3, pp.803-821, 1993.
DOI : 10.2307/2532201

]. M. Bri75 and . Brissaud, Les espaces prétopologiques, C. R. Aead Sci, vol.280, pp.705-708, 1975.

]. P. Bri91 and . Brito, Analyse des données symboliques et pyramides d'héritage, 1991.

S. [. Blatt, E. Wiseman, and . Domany, Data Clustering Using a Model Granular Magnet, Neural Computation, vol.13, issue.8, pp.1805-1842, 1997.
DOI : 10.1162/neco.1994.6.3.341

S. Chelcea, P. Bertrand, and B. Trousse, Un nouvel algorithme de classification ascendante 2-3 hiérarchique, Actes de 14ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle, pp.1471-1480, 2004.

G. [. Chandon and . De-soete, Fitting a least squares ultrametric to dissimilarity data : approximation versus optimization, Data Analysis and Informatics, III, pp.213-221, 1984.

]. E. Cec66 and . Cech, Topological spaces, 1966.

G. [. Celeux and . Govaert, Gaussian parsimonious clustering models, Pattern Recognition, vol.28, issue.5, pp.781-793, 1995.
DOI : 10.1016/0031-3203(94)00125-6

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

]. M. Cha97 and . Chavent, Analyse des données symboliques, Une méthode divisive de classification, 1997.

J. [. Chandon, J. Lemaire, and . Pouget, Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés. Revue d'Automatique , d'Informatique et de, Recherche Opérationnelle, issue.2, pp.14157-170, 1980.
DOI : 10.1051/ro/1980140201571

URL : http://www.numdam.org/article/RO_1980__14_2_157_0.pdf

G. [. Cooper and . Milligan, The effect of measurement error on determining the number of clusters in clusteranalysis, pp.319-328, 1988.

B. [. Cooley, J. Mobasher, and . Srivastava, Data Preparation for Mining World Wide Web Browsing Patterns, Knowledge and Information Systems, vol.27, issue.6, pp.5-32, 1999.
DOI : 10.1007/BF03325089

S. [. Caroll and . Pruzansky, Discrete and hybrid scaling models, Similarity and Choice, pp.108-139

G. [. Celeux and . Soromenho, An entropy criterion for assessing the number of clusters in a mixture model, Journal of Classification, vol.5, issue.2, pp.195-212, 1996.
DOI : 10.1007/BF01246098

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

R. Cucchiara, Analysis and Comparison of different Genetic Models for the Clustering problem in Image Analysis, Artificial Neural Networks and Genetic Algorithms, pp.423-427, 1993.
DOI : 10.1007/978-3-7091-7533-0_61

J. [. De-amorim, C. C. Barthélemy, and . Ribeiro, Clustering and clique partitioning: Simulated annealing and tabu search approaches, Journal of Classification, vol.12, issue.1, pp.17-41, 1992.
DOI : 10.1007/BF02618466

]. H. Dav70 and . David, Order Statistics, 1970.

J. [. Dhillon, Y. Fan, and . Guan, Efficient Clustering of Very Large Document Collections, Data Mining for Scientific and Engineering Applications, 2001.
DOI : 10.1016/0306-4573(88)90027-1

[. Dudoit, J. Fridlyand, and T. P. Speed, Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data, Journal of the American Statistical Association, vol.97, issue.457, pp.9777-87, 2002.
DOI : 10.1198/016214502753479248

G. [. Diday, Y. Govaert, J. Lechevallier, and . Sidi, Clustering in Pattern Recognition, NATO Advanced study Institute on Digital Image Processing and Analysis, 1980.
DOI : 10.1007/978-94-009-8543-8_2

P. [. Duda and . Hart, Pattern Classification and Scene Analysis, 1973.

]. E. Did82 and . Diday, Crossings, orders and ultrametrics : Application to visualization of consensus for comparing classification, Proceedings in Computer Statistics, pp.186-191, 1982.

]. E. Did86 and . Diday, Orders and overlapping clusters by pyramids, Multidimensional Data Analysis, pp.201-234, 1986.

N. [. Dempster, D. B. Laird, and . Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society, Series B, vol.39, issue.1, pp.1-38, 1977.

N. [. Diday and . Murty, Symbolic Data Clustering, Encyclopedia of Data Warehousing and Mining. Idea Group, 2005.
DOI : 10.4018/978-1-59140-557-3.ch204

]. R. Dre86 and . Dreger, Microcomputer programs for the rand index of cluster similarity, Educational and Psychological Measurement, vol.46, issue.3, pp.655-661, 1986.

G. De-soete, A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix, Pattern Recognition Letters, vol.2, issue.3, pp.133-137, 1984.
DOI : 10.1016/0167-8655(84)90036-9

]. G. Dur80 and . Duru, ContributionàContribution`Contributionà l'´ etude des structures des systèmes complexes dans les sciences humaines, 1980.

L. [. Edwards and . Cavalli-sforza, A Method for Cluster Analysis, Biometrics, vol.21, issue.2, pp.363-375, 1965.
DOI : 10.2307/2528096

R. [. Emptoz and . Fages, un approche ensembliste desprobì emes de classification -une applicationàapplication`applicationà l'´ ecologie, Journées internationales sur les développements récents en reconnaissance des formes -Méthodes et applications, 1979.

R. [. Emptoz and . Fages, A set function to cluster analysis, EUSIPCO (1 er congrès de l'association européenne de traitement de signal, 1980.

[. Ester, A. Frommelt, H. Kriegel, and J. Sander, Spatial data mining : Database primitives, algorithms and efficient dbms support, 2000.

[. Ester, H. P. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, KDD, pp.226-231, 1996.

A. [. Eddy, S. Mockus, and . Oue, Approximate single linkage cluster analysis of large data sets in high-dimensional spaces, Computational Statistics & Data Analysis, vol.23, issue.1, pp.29-43, 1996.
DOI : 10.1016/S0167-9473(96)00019-9

]. H. Emp83 and . Emptoz, Modèle prétopologique pour la reconnaissance des formes. Applications en neurophysiologie, 1983.

]. B. Eve79 and . Everitt, Unresolved problems in cluster analysis, Biometrics, vol.35, issue.1, pp.169-181, 1979.

]. B. Eve93 and . Everitt, Cluster Analysis, 1993.

]. V. Fab94 and . Faber, Clustering and the continuous k-means algorithm, 1994.

]. R. Fag74 and . Fages, Programme de classification automatique taxi et taco, 1974.

]. R. Fag78 and . Fages, la dispersion en classification automatique, Communication aux journées sur la Classification, 1978.

]. D. Fas99 and . Fasulo, An analysis of recent work on clustering algorithms, 1999.

]. D. Fis87a and . Fisher, Knowledge acquisition via incremental conceptual clustering, Machine Learning, 1987.

D. H. Fisher, Knowledge acquisition via incremental conceptual clustering, Machine Learning, pp.139-172, 1987.
DOI : 10.1007/BF00114265

]. E. For65 and . Forgy, Cluster analysis of multivariate data : efficency versus interpretability of classifications (abstract), Biometrics, vol.21, pp.768-769, 1965.

]. M. Fre28 and . Frechet, Espaces abstraits. Hermann, 1928.

R. [. Fraboni and . Salstone, The wais-r number-of-factors quandary : A cluster analytic approach to construct validation, Educational and Psychological Measurement, 1992.

W. [. Foss, O. Wang, and . Zaane, A non-parametric approach to web log analysis, 2001.

R. [. Gersho and . Gray, Vector quantization and signal compression, 1992.
DOI : 10.1007/978-1-4615-3626-0

J. [. Ganti, R. Gehrke, and . Ramakrishnan, CACTUS---clustering categorical data using summaries, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.73-83, 1999.
DOI : 10.1145/312129.312201

]. R. Gir97 and . Girard, Classification conceptuelle sur des données arborescentes et imprécises, 1997.

J. [. Gibson, P. Kleinberg, and . Raghavan, Clustering categorical data: an approach based on dynamical systems, The VLDB Journal The International Journal on Very Large Data Bases, vol.8, issue.3-4, pp.3-4222, 2000.
DOI : 10.1007/s007780050005

]. A. Gor81 and . Gordon, Classification. Methods for the exploratory analysis of multivariate data, 1981.

]. A. Gor87 and . Gordon, A review of hierarchical classification, Journal of the Royal Statistical Society, Series A, vol.150, issue.2, pp.119-137, 1987.

]. A. Gor98 and . Gordon, Cluster validation, Data Science, Classification and Related Methods, pp.22-39, 1998.

R. [. Guha, K. Rastogi, and . Shim, Cure : an efficient clustering algorithm for large databases, SIGMOD '98 : Proceedings of the 1998 ACM SIG- MOD international conference on Management of data, pp.73-84, 1998.

S. Guha, R. Rastogi, and K. Shim, Rock: A robust clustering algorithm for categorical attributes, Information Systems, vol.25, issue.5, pp.345-366, 2000.
DOI : 10.1016/S0306-4379(00)00022-3

Y. [. Grötschel and . Wakbayashi, A cutting plane algorithm for a clustering problem, Mathematical Programming, vol.7, issue.1-3, pp.59-96, 1989.
DOI : 10.1007/BF01589097

]. P. Ham64 and . Hammer, Topologies of approximation, Journal of the Society for Industrial and Applied Mathematics, vol.1, pp.69-75, 1964.

]. J. Har67 and . Hartigan, Representation of dissimilarity matrices by trees, J. Amer. Statist. Ass, vol.62, pp.1140-1158, 1967.

]. J. Har75 and . Hartigan, Clustering Algorithms, 1975.

]. J. Har85 and . Hartigan, Statistical theory in clustering, Journal of Classification, vol.2, pp.63-76, 1985.

]. M. Has82 and . Hashom, Plus proches voisins et classification automatique Applicationàtion`tionà des données industrielles, 1982.

E. [. Heer and . Chi, Identification of web user traffic composition using multi-modal clustering and information scent, 2001.

C. [. Hamerly and . Elkan, Learning the k in k-means, Advances in Neural Information Processing Systems, 2003.

D. [. Hinneburg and . Keim, An efficient approach to clustering in large multimedia databases with noise, KDD, pp.58-65, 1998.

M. [. Han and . Kamber, Data Mining, 2001.
DOI : 10.1007/978-1-4899-7993-3_104-2

F. [. Harik, D. E. Lobo, and . Goldberg, The compact genetic algorithm, Proceedings of the IEEE Conference on Evolutionary Computation, pp.523-528, 1998.

I. [. Hall, J. C. Ozyurt, and . Bezdek, Clustering with a genetically optimized approach, Une nouvelle approche desprobì emes de classification automatique. Statistiques et Analyse des Données, pp.103-11241, 1982.
DOI : 10.1109/4235.771164

J. [. Hanson, P. Stutz, and . Cheesman, Bayesian classification theory, 1990.

L. J. Hubert, Monotone invariant clustering procedures, Psychometrika, vol.58, issue.1, pp.47-62, 1973.
DOI : 10.1007/BF02291173

M. [. Jones and . Beltramo, Solving partitioning problems with genetic algorithms, Proc. of the Fourth International Conference on Genetic Algorithms, pp.442-449, 1991.

R. [. Jain and . Dubes, Algorithms for Clustering Data, 1988.

N. [. Jardine, R. Jardine, and . Sibson, The structure and construction of taxonomic hierarchies, Mathematical Biosciences, vol.1, issue.2, pp.171-179, 1967.
DOI : 10.1016/0025-5564(67)90032-6

M. [. Jain, P. J. Murty, and . Flynn, Data clustering: a review, ACM Computing Surveys, vol.31, issue.3, pp.264-323, 1999.
DOI : 10.1145/331499.331504

]. S. Joh67 and . Johnson, Hierarchical clustering schemes, Psychometrika, vol.32, pp.241-245, 1967.

]. A. Kau75 and . Kaufmann, IntroductionàIntroduction`Introductionà la théorie des sous-ensembles flous :Applicationsàtions`tionsà la classification etàet`età la reconnaissance des formes, aux automates et aux systèmes, 1975.

R. [. Kelin and . Dubes, Experiments in projection and clustering by simulated annealing, Pattern Recognition, vol.22, issue.2, pp.213-220, 1989.
DOI : 10.1016/0031-3203(89)90067-8

]. M. Ken66 and . Kendall, Discirmination and classification, Multivariate Analysis, pp.165-185, 1966.

C. [. Kirpaktrick, . Jr, M. P. Gelatt, and . Vecchi, Optimization by simulated annealing, 1982.

C. [. Kirkpatrick, M. P. Gelatt, and . Vecchi, Optimization by simulated annealing, Science, Number, vol.4598, issue.4598, pp.671-680, 1983.

Y. [. Krzanowski and . Lai, A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering, Biometrics, vol.44, issue.1, pp.23-34, 1988.
DOI : 10.2307/2531893

]. T. Kla83 and . Klastorin, Assessing cluster analysis results, Journal of Marketing Research, vol.20, issue.1, pp.92-98, 1983.

]. Y. Kod92 and . Kodratoff, Symbolic or numeric induction ?, Journées Symboliques Numériques, pp.31-50, 1992.

T. Kohonen, Self-organized formation of topologically correct feature maps, Biological Cybernetics, vol.13, issue.1, pp.59-69, 1982.
DOI : 10.1007/BF00337288

]. T. Koh88 and . Kohonen, Self-organized formation of topologically correct feature maps, pp.509-521, 1988.

]. T. Koh00 and . Kohonen, Self-organizing Maps, Series in Information Sciences, 2000.

P. [. Kaufman and . Rousseeuw, Finding Groups in Data, 1990.
DOI : 10.1002/9780470316801

]. J. Lag95 and . Lagarde, InitiationàInitiation`Initiationà l'analyse des données. Dunod, 1995.

]. M. Lam87 and . Lamure, Espaces abstraits et reconnaissance de formes Application au traitement des images digitales, 1987.

A. [. Lucasius, G. Dane, and . Kateman, On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasiblity and comparison, Analytica Chimica Acta, vol.282, issue.3, pp.647-669, 1993.
DOI : 10.1016/0003-2670(93)80130-D

]. I. Ler81 and . Lerman, Classification et analyse ordinale des données, 1981.

]. C. Les91 and . Leschi, Aspects fondamentaux etévolutifsetévolutifs de la reconnaissance de formes, 1991.

R. [. Lawson and . Hanson, Solving Least Squares Problems, 1974.
DOI : 10.1137/1.9781611971217

C. [. Lin, C. C. Kao, and . Hsu, Applying the genetic approach to simulated annealing in solving some NP-hard problems, IEEE Transactions on Systems, Man, and Cybernetics, vol.23, issue.6, pp.1752-1767, 1993.

]. J. Lldo, P. Lozano, and . Larrañaga, Applying genetic algorithms to search for the best hierarchical clustering of a dataset, Pattern Recognition Letters

J. [. Lerman, P. Nicolas, and . Peter, Classification conceptuele : une approche dans la combinaison de méthodes numériques et symboliques, Actes des 2` eme journées " Symboliques Numériques " pour l'apprentissage de connaissancesàconnaissances`connaissancesà partir des données Diday and Y. Kodratoff, pp.79-93, 1988.

A. [. Morey and . Agresti, The Measurement of Classification Agreement: An Adjustment to the Rand Statistic for Chance Agreement, Educational and Psychological Measurement, vol.44, issue.1, pp.33-37, 1984.
DOI : 10.1177/0013164484441003

J. B. Macqueen, Some methods for classification and analysis of multivariate observations, Proceedings of Fifth Berkeley Symposium, pp.281-297, 1967.

]. M. Man88 and . Manago, Intégration de techniques numériques et symboliques en apprentissage automatique, 1988.

M. [. Milligan and . Cooper, An examination of procedures for determining the number of clusters in a data set, Psychometrika, vol.77, issue.2, pp.159-179, 1985.
DOI : 10.1007/BF02294245

E. [. Menessier and . Diday, Approche symbolique pour la prévision de séries chronologiques pseudo-périodiques, Actes des journées " Symboliques -Numérique " pour l'apprentissage de connaissancesàconnaissances`connaissancesà partir d'observations. Y. Kodratoff and E. Diday, 1988.

]. B. Mir96 and . Mirkin, Mathematical Classification and Clustering, 1996.

]. M. Mit96 and . Mitchell, An Introduction to Genetic Algorithms, 1996.

L. [. Massart and . Kaufman, Interpretation of Analytical Chemical Data by the Use of Cluster Analysis, 1983.

P. [. Marcotorchino and . Michaud, Agrégation de similarités en classification automatique, 1982.

]. R. Ms83a, R. E. Michalski, and . Stepp, Automated construccion of classifications : Conceptual clustering versus numerical taxonomy, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.5, pp.219-243, 1983.

]. R. Ms83b, R. E. Michalski, and . Stepp, Learning from observation : Conceptual clustering, Machine learning : An artificial intelligence approach, 1983.

R. [. Michalski, E. Stepp, and . Diday, A RECENT ADVANCE IN DATA ANALYSIS: Clustering Objects into Classes Characterized by Conjunctive Concepts, Progress in Pattern Recognition, 1981.
DOI : 10.1016/B978-0-444-86325-6.50005-9

W. [. Macnaughton-smith, M. B. Williams, L. G. Dale, and . Mockett, Dissimilarity Analysis: a new Technique of Hierarchical Sub-division, Nature, vol.48, issue.4936, pp.1034-1035, 1964.
DOI : 10.1038/2021034a0

N. Monmarché, G. Venturini, and M. Slimane, Classification non supervisée par une population de fourmis artificielles, Actes des Colloques Insectes Sociaux, pp.43-52, 1999.

J. [. Ng and . Han, Efficient and effective clustering methods for spatial data mining, 20th International Conference on Very Large Data Bases, pp.144-155, 1994.

J. [. Ng and . Han, CLARANS: a method for clustering objects for spatial data mining, IEEE Transactions on Knowledge and Data Engineering, vol.14, issue.5, pp.1003-1016, 2002.
DOI : 10.1109/TKDE.2002.1033770

]. N. Nic88 and . Nicoloyannis, Structure prétopologiques et classification automatique : le logiciel DEMON, 1988.

P. [. Otto and . Henning, Aggregation of ordinal judgements based on condorcet's majority rule. Data Analysis and Decision Support, pp.108-112, 2005.

]. K. Pea01 and . Pearson, On lines and planes of closest fit to systems of points in space, Philosophical Magazine, vol.6, issue.2, pp.559-572, 1901.

]. G. Pol98 and . Polaillon, Organisation et interprétation par les treillis de Galois de données de type multivalué, intervalle ou histogramme, 1998.

]. W. Ran71 and . Rand, Objective criteria for the evaluation of clustering methods, Journal of the American Statistical Association, vol.66, issue.336, pp.846-850, 1971.

J. [. Raghadan and . Bhuyan, A clustering strategy based on a formalism of the reproductive process in natural systems, ACM SIGIR Forum, vol.14, issue.2, pp.10-22, 1979.
DOI : 10.1145/1013232.511709

]. C. Ree93 and . Reeves, Modern Heuristic Techniques for Combinatorial Optimization, Blackwell Scientific Publications, 1993.

]. S. Reg65 and . Regnier, Sur quelques aspects mathématiques desprobì emes de classification automatique, I.C.C. Bulletin, vol.175, issue.4, 1965.

]. J. [-ris78 and . Rissanen, Modeling by shortest data description, Automatica, vol.14, pp.465-471, 1978.

T. [. Rasson and . Kubushishi, The gap test: an optimal method for determining the number of natural classes in cluster analysis, New Approaches in Classification and Data Analysis, pp.186-193, 1993.
DOI : 10.1007/978-3-642-51175-2_21

]. G. Rud94 and . Rudolph, Massively parallel simulated annealing and its relation to evolutionary algorithms, Evolutionary Computation, vol.1, issue.4, pp.361-382, 1994.

]. J. Sar82 and . Sarsoh, Fonctions structurantes et classification automatique Applicationàtion`tionà desprobì emes de génétique, 1982.

F. [. Souza and . Carvalho, Clustering of interval data based on city???block distances, Pattern Recognition Letters, vol.25, issue.3, pp.353-365, 2004.
DOI : 10.1016/j.patrec.2003.10.016

]. H. Sch81 and . Schwefel, Numerical Optimization of Computer Models, 1981.

]. P. Sch97 and . Schuur, Classification of acceptance criteria for the simulated annealing algorithm, Mathematics of operations research, vol.22, issue.2, pp.266-275, 1997.

S. [. Sheikholeslami, A. Chatterjee, and . Zhang, WaveCluster: a wavelet-based clustering approach for spatial data in very large databases, The VLDB Journal The International Journal on Very Large Data Bases, vol.8, issue.3-4, pp.3-4289, 2000.
DOI : 10.1007/s007780050009

]. J. Sid80 and . Sidi, L'approche logique en classification automatique et reconnaissance des formes, 1980.

G. [. Steinbach, V. Karypis, and . Kumar, A comparison of document clustering techniques, 2000.

M. [. Srivastava and . Murty, A comparison between conceptual clustering and conventional clustering, Pattern Recognition, vol.23, issue.9, pp.975-981, 1990.
DOI : 10.1016/0031-3203(90)90106-U

R. [. Solis and . Wets, Minimization by Random Search Techniques, Mathematics of Operations Research, vol.6, issue.1, pp.19-30, 1981.
DOI : 10.1287/moor.6.1.19

B. [. Sarkar, D. Yegnanarayana, and . Khemani, A clustering algorithm using an evolutionary programming-based approach, Pattern Recognition Letters, vol.18, issue.10, pp.975-986, 1997.
DOI : 10.1016/S0167-8655(97)00122-0

R. Tibshirani, G. Walther, and T. Hastie, Estimating the number of clusters in a dataset via the gap statistic, 2000.

E. [. Van-laarhoven and . Aarts, Simulated Annealing : Theory and Applications, 1987.
DOI : 10.1007/978-94-015-7744-1

J. [. Van-nimwegen, M. Crutchfield, and . Mitchell, Statistical Dynamics of the Royal Road Genetic Algorithm, Theoretical Computer Science, vol.229, issue.1-2, pp.41-102, 1999.
DOI : 10.1016/S0304-3975(99)00119-X

]. M. Vra02 and . Vrac, Analyse et modélisation de données probabilistes par décomposition de mélanges de copules : ApplicationàApplication`Applicationà une base de données climatologiques, 2002.

P. [. Wallace and . Freeman, Estimation and inference by compact coding, Journal of the Royal Statistical Society, vol.49, issue.3, pp.240-265, 1987.

C. S. Wallace, K. B. Korb, and H. Dai, Causal discovery via MML, International Conference on Machine Learning, pp.516-524, 1996.

J. [. Williams and . Lambert, Multivariate Methods in Plant Ecology: I. Association-Analysis in Plant Communities, The Journal of Ecology, vol.47, issue.1, pp.83-101, 1959.
DOI : 10.2307/2257249

J. [. Wang, R. R. Yang, and . Muntz, STING : A statistical information grid approach to spatial data mining, Twenty-Third International Conference on Very Large Data Bases, pp.186-195, 1997.

M. [. Xu, H. P. Ester, J. Kriegel, and . Sander, A distribution-based clustering algorithm for mining in large spatial databases, ICDE '98 : Proceedings of the Fourteenth International Conference on Data Engineering, pp.324-331, 1998.

C. H. Zha, M. Ding, X. Gu, H. He, and . Simon, Spectral relaxation for k-means clustering, 2001.

R. [. Zhang, M. Ramakrishnan, and . Livny, Birch : an efficient data clustering method for very large databases, SIGMOD '96 : Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pp.103-114, 1996.

R. [. Zhang, M. Ramakrishnan, and . Livny, Birch : A new data clustering algorithm and its applications, 1997.