Clustering using a coarse-grained parallel Genetic Algorithm : APreliminary

Genetic Algorithms (GA) are useful in solving complex optimization problems. By posing pattern clustering as an optimization problem, GAs can be used to obtain an optimal minimum squared-error partitions. In order to improve the total execution time, a distributed algorithm has been developed using the divide and conquer approach. Using a standard communication library called PVM, the distributed algorithm has been implemented on a workstation cluster. The GA approach gives better quality clusters for many data sets compared to a standard K-Means clustering algorithm. We have achieved a near linear speedup for the distributed implementation.

[1]  Philippe Andrey,et al.  Unsupervised image segmentation using a distributed genetic algorithm , 1994, Pattern Recognit..

[2]  Jerzy W. Bala,et al.  Shape analysis using genetic algorithms , 1993, Pattern Recognit. Lett..

[3]  Christopher M. Brown,et al.  Parallel genetic algorithms on distributed-memory architectures , 1993 .

[4]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[5]  Sartaj Sahni,et al.  Clustering on a hypercube multicomputer , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[6]  Jack Sklansky,et al.  A note on genetic algorithms for large-scale feature selection , 1989, Pattern Recognit. Lett..

[7]  Richard C. Dubes,et al.  Experiments in projection and clustering by simulated annealing , 1989, Pattern Recognit..

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

[9]  Anil K. Jain,et al.  A VLSI Systolic Architecture for Pattern Clustering , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.