Design of hybrids for the minimum sum-of-squares clustering problem

DOI10.1016/S0167-9473(02)00224-4zbMath1429.65124OpenAlexW1997713127MaRDI QIDQ951921

Joaquín Pacheco, Olga Valencia

Publication date: 4 November 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(02)00224-4

zbMATH Keywords

metaheuristicstabu searchgenetic algorithmshybrid algorithmsmemetic algorithmsclusterization

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

The hyperbolic smoothing clustering method ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ Applications of optimization heuristics to estimation and modelling problems ⋮ Experiments with, and on, algorithms for maximum likelihood clustering ⋮ Linear grouping using orthogonal regression ⋮ A scatter search approach for the minimum sum-of-squares clustering problem ⋮ 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 ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem

Uses Software

• TSPLIB
• J-MEANS
• Tabu search
• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments in projection and clustering by simulated annealing
• A probabilistic heuristic for a computationally difficult set covering problem
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• A Branch and Bound Clustering Algorithm
• A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Evaluation of a Branch and Bound Algorithm for Clustering
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Design of hybrids for the minimum sum-of-squares clustering problem