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

Authors:
Joaquín Pacheco;Olga Valencia
Affiliations:
Department of Applied Economics, University of Burgos, Plaza Infanta Elena s/n Burgos 09001, Spain;Department of Applied Economics, University of Burgos, Plaza Infanta Elena s/n Burgos 09001, Spain
Venue:
Computational Statistics & Data Analysis
Year:
2003

Citing 6
Cited 6

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm

Pattern Recognition Letters
Variable neighborhood search

Computers and Operations Research
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

SIAM Journal on Scientific Computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search

Tabu Search

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

Computers and Operations Research
Linear grouping using orthogonal regression

Computational Statistics & Data Analysis
The hyperbolic smoothing clustering method

Pattern Recognition
The use of a genetic algorithm for clustering the weighing station performance in transportation - A case study

Expert Systems with Applications: An International Journal
A GRASP method for building classification trees

Expert Systems with Applications: An International Journal
A scatter search algorithm for the automatic clustering problem

ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining

Quantified Score

Hi-index	0.03

Visualization

Abstract

A series of metaheuristic algorithms is proposed and analyzed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. These algorithms incorporate genetic operators and local search and tabu search procedures. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithms obtain better results than previously reported methods, especially with a small number of clusters.