Finding the Natural Groupings in a Data Set Using Genetic Algorithms

Genetic Algorithms (GAs) are generally portrayed as a search procedure which can optimize functions based on a limited sample of function values. In this paper, an objective function based on minimal spanning tree (MST) of data points is proposed for clustering and GAs have been used in an attempt to optimize the specified objective function in order to detect the natural grouping in a given data set. Several experiments on synthetic data set in \({\frak R}^2\) show the utility of the proposed method. The method is also applicable to any higher dimensional data.

[1]  C. A. Murthy,et al.  Finding a Subset of Representative Points in a Data Set , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[2]  Yong Gao,et al.  Comments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [and reply] , 1998, IEEE Trans. Neural Networks.

[3]  Stefan Bornholdt,et al.  General asymmetric neural networks and structure design by genetic algorithms: a learning rule for temporal patterns , 1992, Proceedings of IEEE Systems Man and Cybernetics Conference - SMC.

[4]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[5]  C. A. Murthy,et al.  In search of optimal clusters using genetic algorithms , 1996, Pattern Recognit. Lett..

[6]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[9]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[10]  Frederick E. Petry,et al.  Scene recognition using genetic algorithms with semantic nets , 1990, Pattern Recognit. Lett..

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

[12]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[13]  José Carlos Príncipe,et al.  A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm , 1991, ICGA.

[14]  Julius T. Tou,et al.  Pattern Recognition Principles , 1974 .

[15]  Donald R. Jones,et al.  Solving Partitioning Problems with Genetic Algorithms , 1991, International Conference on Genetic Algorithms.