A simulated annealing algorithm with a dual perturbation method for clustering

•Existing partitional clustering algorithms still settle upon local optima.•We propose a new simulated annealing algorithm with two perturbation methods.•We compare our algorithm with existing simulated annealing clustering algorithms.•We show our new algorithm produces clusters of higher quality mo...

Celý popis

Podrobná bibliografia

Vydané v:	Pattern recognition Ročník 112; s. 107713
Hlavní autori:	Lee, Julian, Perkins, David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.04.2021
Predmet:	K-means Partitional clustering Simulated annealing Sum of squared error criterion K-means Sum of squared error criterion Partitional clustering Simulated annealing
ISSN:	0031-3203, 1873-5142
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!