A simulated annealing algorithm with a dual perturbation method for clustering
Authors:
- Julian LeeJLJulian Lee
- David PerkinsDPDavid Perkins
- 1 April 2021
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 112
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A comparative study of efficient initialization methods for the k-means clustering algorithmExpert Systems with Applications, 2013
- K-harmonic means data clustering with simulated annealing heuristicApplied Mathematics and Computation, 2007
- The enhanced LBG algorithmNeural Networks, 2001
- J-Means: a new local search heuristic for minimum sum of squares clusteringPattern Recognition, 2001
- Genetic K-means algorithmIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1999
- A Tabu search approach to the clustering problemPattern Recognition, 1995
- A practical application of simulated annealing to clusteringPattern Recognition, 1992
- Experiments in projection and clustering by simulated annealingPattern Recognition, 1989
- Optimization by Simulated AnnealingScience, 1983
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated ClustersJournal of Cybernetics, 1973