Parallelizing evolutionary algorithms for clustering data

Authors:
Wojciech Kwedlo
Affiliations:
Faculty of Computer Science, Białystok Technical University, Białystok, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 9
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Vector quantization and signal compression

Vector quantization and signal compression
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
MPI: The Complete Reference

MPI: The Complete Reference
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Clustering with a genetically optimized approach

IEEE Transactions on Evolutionary Computation
Parallelism and evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper the problem of using an evolutionary algorithm to partition a dataset into a known number of clusters is considered. A novel approach, based on data decomposition, for parallel computing of the fitness function is proposed. Both the learning set and the population of the evolutionary algorithm are distributed among processors. Processors form a pipeline using the ring topology. In a single step each processor computes the local fitness of its current subpopulation while sending the previous subpopulation to the successor and receiving next subpopulation from the predecessor. Thus it is possible to overlap communication and computation using non-blocking MPI routines. Our approach to parallel fitness computation was applied to differential evolution algorithm. The results of initial experiments show, that for large datasets the algorithm is capable of achieving very good scalability.