Particle swarm optimization with selective particle regeneration for data clustering

► We present a novel algorithm developed based on particle swarm optimization. ► The algorithm contains particle regeneration operation. ► We apply this algorithm to data clustering problems. ► The proposed algorithm performs very well in the conducted numerical experiment. This paper presents selec...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Expert systems with applications Ročník 38; číslo 6; s. 6565 - 6576
Hlavní autori: Tsai, Chi-Yang, Kao, I-Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.06.2011
Predmet:
Algorithms
Clustering
Convergence
Data clustering
Expert systems
K-means algorithm
Mathematical models
Optimization
Particle swarm optimization
Performance evaluation
Regeneration
K-means algorithm
Particle swarm optimization
Data clustering
ISSN:0957-4174, 1873-6793
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:► We present a novel algorithm developed based on particle swarm optimization. ► The algorithm contains particle regeneration operation. ► We apply this algorithm to data clustering problems. ► The proposed algorithm performs very well in the conducted numerical experiment. This paper presents selective regeneration particle swarm optimization (SRPSO), a novel algorithm developed based on particle swarm optimization (PSO). It contains two new features, unbalanced parameter setting and particle regeneration operation. The unbalanced parameter setting enables fast convergence of the algorithm and the particle regeneration operation allows the search to escape from local optima and explore for better solutions. This algorithm is applied to data clustering problems for performance evaluation and a hybrid algorithm (KSRPSO) of K-means clustering method and SRPSO is developed. In the conducted numerical experiments, SRPSO and KSRPSO are compared to the original PSO algorithm, K-means, as well as, other methods proposed by other studies. The results demonstrate that SRPSO and KSRPSO are efficient, accurate, and robust methods for data clustering problems.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2010.11.082