Abstract
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.
Keywords
Symbolic clustering symbolic similarity symbolic dissimilarity genetic algorithms path length spanning length best spanning lengthPreview
Unable to display preview. Download preview PDF.
References
- Bock H H (ed.) 1987Classification and related methods of data analysis (Amsterdam: North Holland)Google Scholar
- Diday E (ed.) 1989Data analysis, learning symbolic and numeric knowledge (Antibes, France: Nova Science)Google Scholar
- Diday E 1990From numerical to symbolic clustering, COMPSTAT Dubrovnik, YugoslaviaGoogle Scholar
- Diday E, Simon J C 1976Clustering analysis: Communication and cybernetics (New York: Springer Verlag) vol.10, pp 47–92Google Scholar
- Diday E, Hayashi C, Jambu M, Ohsumi N (eds) 1987Recent developments in clustering and data analysis (New York: Academic Press)Google Scholar
- Duda R O, Hart P E 1973Pattern classification and scene analysis (New York: Wiley Interscience)MATHGoogle Scholar
- Gowda K C, Diday E 1991a Symbolic clustering using a new dissimilarity measure.Pattern Recogn. 24: 567–578CrossRefGoogle Scholar
- Gowda K C, Diday E 1991b Unsupervised learning through symbolic clustering.Pattern Recogn. Lett. 12: 259–264CrossRefGoogle Scholar
- Gowda K C, Diday E 1992 Symbolic clustering using a new similarity measure.IEEE Trans. Syst. Man Cybern. 22: 368–378CrossRefGoogle Scholar
- Ichino M 1988 General metrics for mixed features — The Cartesian space theory for pattern recognition.Proc. IEEE Conference on Systems, Man and Cybernetics Google Scholar
- Ichino M, Yaguchi H 1989 Generalised Minkoswki metrics for mixed features.Trans. IEICE Japan J 72-A: 398–405 (in Japanese)Google Scholar
- Jain A K, Dubes R C 1988Algorithms for clustering data (Englewood Cliffs, NJ: Prentice Hall)MATHGoogle Scholar