Clustering by a genetic algorithm with biased mutation operator

• In this paper we propose a genetic al- gorithm that partitions data into a given number of clusters. The algorithm can use any cluster validity function as fitness function. Cluster validity is used as a criterion for cross-over operations. The cluster assignment for each point is accompanied by a tem- perature and points with low confidence are pref- erentially mutated. We present results applying this genetic algorithm to several UCI machine learning data sets and using several objective cluster validity functions for optimization. It is shown that given an appropriate criterion function, the algorithm is able to converge on good cluster partitions within few generations. Our main contributions are: 1. to present a genetic algorithm that is fast and able to converge on meaningful clusters for real-world data sets, 2. to define and compare several cluster validity criteria. 

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Nyckelord

learning (artificial intelligence)

pattern clustering

UCI machine learning

cluster validity function

criterion function

crossover operation

fitness function

genetic algorithm

mutation operator

optimization

SRA - ICT

SRA - Informations- och kommunikationsteknik

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)