Messy genetic algorithm for clustering

Research output: Contribution to conferencePaper

3 Scopus citations

Abstract

A new algorithm is proposed for clustering, drawing on the ideas underlying messy genetic algorithms. Individuals in each generation are clusters whose fitness depends on the mean distance between samples in the same cluster. The algorithm consists of four phases: initialization, cluster-formation, operator-application, and final cluster-selection. Four operators are used: merge, split, erode, and gobble. The algorithm is fairly general, and the function to be optimized can be modified to obtain good clusters that satisfy different requirements.

Original languageEnglish (US)
Pages831-836
Number of pages6
StatePublished - Dec 1 1993
EventProceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93 - St.Louis, MO, USA
Duration: Nov 14 1993Nov 17 1993

Other

OtherProceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93
CitySt.Louis, MO, USA
Period11/14/9311/17/93

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Messy genetic algorithm for clustering'. Together they form a unique fingerprint.

Cite this