Finding Groups in Data: Cluster Analysis with Ants

We present in this paper a modification of Lumer and Faieta's algorithm for data clustering. This algorithm discovers automatically clusters in numerical data without prior knowledge of possible number of clusters. We have applied this algorithm on standard databases and we get very good results compared to the AntClass, k-means and ISODATA algorithms for IRIS dataset

[1]  Isidore Rigoutsos,et al.  An algorithm for point clustering and grid generation , 1991, IEEE Trans. Syst. Man Cybern..

[2]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[3]  B. Jaumard,et al.  Minimum sum of diameters clustering , 1987 .

[4]  M. R. Brito,et al.  Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection , 1997 .

[5]  Richard C. T. Lee.  Clustering Analysis and Its Applications , 1981 .

[6]  P. Brucker.  On the Complexity of Clustering Problems , 1978 .

[7]  Hilarie K. Orman,et al.  Activating Networks: A Progress Report , 1999, Computer.

[8]  Howard GutowitzESPCI,et al.  Complexity-Seeking Ants , 1994 .

[9]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

[10]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[11]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[12]  E. Bonabeau.  From classical models of morphogenesis to agent-based models of pattern formation , 1997 .

[13]  Baldo Faieta,et al.  Diversity and adaptation in populations of clustering ants , 1994 .

[14]  Mohamed Zaït,et al.  A comparative study of clustering methods , 1997, Future Gener. Comput. Syst..

[15]  Sudipto Guha,et al.  CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.

[16]  Johannes Gehrke,et al.  CACTUS—clustering categorical data using summaries , 1999, KDD '99.

[17]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[18]  C. J. van Rijsbergen,et al.  Information Retrieval , 1979, Encyclopedia of GIS.

[19]  Michalis Vazirgiannis,et al.  Quality Scheme Assessment in the Clustering Process , 2000, PKDD.

[20]  Julia Handl,et al.  Improved Ant-Based Clustering and Sorting , 2002, PPSN.

[21]  Anil K. Jain,et al.  Clustering Methodologies in Exploratory Data Analysis , 1980, Adv. Comput..

[22]  G. Venturini,et al.  AntClass : discovery of clusters in numeric data by anhybridization of an ant colony with the KmeansalgorithmN , 1999 .

[23]  Marco Dorigo,et al.  From Natural to Artificial Swarm Intelligence , 1999 .

[24]  Jon M. Kleinberg,et al.  Clustering categorical data: an approach based on dynamical systems , 2000, The VLDB Journal.

[25]  Jean-Louis Deneubourg,et al.  Organisation spatiale du matériel provenant de l'excavation du nid chez Messor barbarus et des cadavres d'ouvrières chez Lasius niger (Hymenopterae: Formicidae) , 1996 .

[26]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[27]  N. Franks,et al.  Brood sorting by ants: distributing the workload over the work-surface , 1992, Behavioral Ecology and Sociobiology.

[28]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[29]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[30]  H. L. Le Roy,et al.  Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[31]  Bernhard Korte,et al.  Optimization and Operations Research , 1976 .

[32]  Jean-Louis Deneubourg,et al.  The dynamics of collective sorting robot-like ants and ant-like robots , 1991 .

[33]  Sorinel A. Oprisan,et al.  Functional self-organization performing wide-sense stochastic processes , 1996 .

[34]  W. Welch.  Algorithmic complexity: three NP- hard problems in computational statistics , 1982 .

[35]  John F. Roddick,et al.  A comparative study and extensions to k-medoids algorithms , 2001 .

[36]  George Karypis,et al.  C HAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling , 1999 .

[37]  Marco Dorigo,et al.  Ant-based clustering: a comparative study of its relative performance with respect to k-means, average link and 1d-som , 2003 .