A computational study of several relocation methods for \(k\)-means algorithms.

DOI10.1016/S0031-3203(03)00190-0zbMath1059.68116MaRDI QIDQ1425990

Agostino Tarsitano

Publication date: 14 March 2004

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

zbMATH Keywords

Combinatorial optimizationIterative partitioningNon-hierarchical classification

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items

Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis ⋮ A hybrid ACO-GRASP algorithm for clustering analysis ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ A hybrid stochastic genetic-GRASP algorithm for clustering analysis

Cites Work

• Multidimensional data clustering utilizing hybrid search strategies
• Mechanisms for local search
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Computer Aided Design of Experiments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item