Nonparametric genetic clustering: comparison of validity indices

IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)Published 1 January 2001

Sanghamitra Bandyopadhyay, Ujjwal Maulik

Citations265

TL;DR

A variable-string-length genetic algorithm is used for developing a novel nonparametric clustering technique when the number of clusters is not fixed a-priori.

Abstract

A variable-string-length genetic algorithm (GA) is used for developing a novel nonparametric clustering technique when the number of clusters is not fixed a-priori. Chromosomes in the same population may now have different lengths since they encode different number of clusters. The crossover operator is redefined to tackle the concept of variable string length. A cluster validity index is used as a measure of the fitness of a chromosome. The performance of several cluster validity indices, namely the Davies-Bouldin (1979) index, Dunn's (1973) index, two of its generalized versions and a recently developed index, in appropriately partitioning a data set, are compared.

Keywords

Computer ScienceBiochemistry, Genetics and Molecular Biology

Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning

49,278 Citations1989

This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.

Genetic Algorithms in Search, Optimization and Machine Learning

17,773 Citations1988David E. Goldberg, David Robson

Annals of EugenicsTHE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS

14,727 Citations1936Ronald Aylmer Fisher

View PDF

IEEE Transactions on Pattern Analysis and Machine IntelligenceA Cluster Separation Measure

8,543 Citations1979David L. Davies, Donald W. Bouldin

A measure is presented which indicates the similarity of clusters which are assumed to have a data density which is a decreasing function of distance from a vector characteristic of the cluster which can be used to infer the appropriateness of data partitions.

Handbook of Genetic Algorithms

7,308 Citations1991Lawrence Davis

Journal of CyberneticsA Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

6,548 Citations1973J. C. Dunn

Two fuzzy versions of the k-means optimal, least squared error partitioning problem are formulated for finite subsets X of a general inner product space; in both cases, the extremizing solutions are shown to be fixed points of a certain operator T on the class of fuzzy, k-partitions of X, and simple iteration of T provides an algorithm which has the descent property relative to the least squarederror criterion function.

Pattern Recognition Principles

3,205 Citations2009

The present work gives an account of basic principles and available techniques for the analysis and design of pattern processing and recognition systems.

Pattern RecognitionGenetic algorithm-based clustering technique

1,447 Citations2000Ujjwal Maulik, Sanghamitra Bandyopadhyay

The superiority of the GA-clustering algorithm over the commonly used K-means algorithm is extensively demonstrated for four artificial and three real-life data sets.

IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Some new indexes of cluster validity

1,142 Citations1998James C. Bezdek, Nikhil R. Pal

Complex SystemsMessy genetic algorithms: motivation, analysis, and first results

1,128 Citations1989David E. Goldberg, Bradley Korb +1 more

The mGA presented herein repeatedly achieves globally optimal results without prior knowledge of good string arrangements, and it does so at the very first generation in which strings are long enough to cover the problem.