Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.

[1]  M. Ichino.  General Metrics For Mixed Features The Cartesian Space Theory For Pattern Recognition , 1988, Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics.

[2]  K. Chidananda Gowda,et al.  Symbolic clustering using a new similarity measure , 1992, IEEE Trans. Syst. Man Cybern..

[3]  Edwin Diday,et al.  Unsupervised learning through symbolic clustering , 1991, Pattern Recognit. Lett..

[4]  Edwin Diday,et al.  Symbolic clustering using a new dissimilarity measure , 1991, Pattern Recognit..

[5]  Hans-Hermann Bock,et al.  Classification and Related Methods of Data Analysis , 1988 .

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

[7]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.