A scatter search approach for the minimum sum-of-squares clustering problem

Authors:
Joaquín A. Pacheco
Affiliations:
Department of Applied Economics, University of Burgos, Plaza Infanta Elena s/n, Burgos 09001, Spain
Venue:
Computers and Operations Research
Year:
2005

Citing 5
Cited 4

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

Pattern Recognition Letters
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

SIAM Journal on Scientific Computing
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Design of hybrids for the minimum sum-of-squares clustering problem

Computational Statistics & Data Analysis

Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Investigation of a new GRASP-based clustering algorithm applied to biological data

Computers and Operations Research
A mixed integer linear model for clustering with variable selection

Computers and Operations Research

Quantified Score

Hi-index	0.06

Visualization

Abstract

A metaheuristic procedure based on the scatter search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. This algorithm incorporates procedures based on different strategies, such as local search, GRASP, tabu search or path relinking. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithm obtains better results than previously reported methods, especially with small numbers of clusters.