A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

DOI10.1016/0167-8655(93)90058-LzbMath0802.68116OpenAlexW2058324463MaRDI QIDQ4287141

G. Phanendra Babu, M. Narasimha Murty

Publication date: 11 December 1994

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(93)90058-l

zbMATH Keywords

clusteringgenetic algorithm\(K\)-means algorithmoptimal partitioningseed values

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Related Items

Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis, A selection process for genetic algorithm using clustering analysis, Clustering in non-stationary environments using a clan-based evolutionary approach, Metaheuristics: A bibliography, A hybrid ACO-GRASP algorithm for clustering analysis, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), Fast global \(k\)-means clustering based on local geometrical information, A hybrid stochastic genetic-GRASP algorithm for clustering analysis, Design of hybrids for the minimum sum-of-squares clustering problem, A scatter search approach for the minimum sum-of-squares clustering problem, A mixed-integer programming approach to the clustering problem with an application in customer segmentation, J-MEANS: A new local search heuristic for minimum sum of squares clustering, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection, A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks