Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm

zbMath0808.68054MaRDI QIDQ1331167

M. Narasimha Murty, G. Phanendra Babu

Publication date: 14 August 1994

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

simulated annealingclustering methodspartitional algorithmsprobabilistic search methodselected data sets

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Metaheuristics: A bibliography ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning

This page was built for publication: Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm