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

被引：22

作者：

Pacheco, Joaquín ^{[1
]}

Valencia, Olga ^{[1
]}

机构：

[1] Department of Applied Economics, University of Burgos, Burgos 09001, Plaza Infanta Elena s/n

来源：

Computational Statistics and Data Analysis | 2003年 / 43卷 / 02期

关键词：

Clusterization; Genetic algorithms; Hybrid algorithms; Memetic algorithms; Metaheuristics; Tabu search;

D O I：

10.1016/S0167-9473(02)00224-4

中图分类号：

学科分类号：

摘要：

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. © 2003 Elsevier Science B.V. All rights reserved.

引用

页码：235 / 248

页数：13

共 28 条

[1]

Al-Sultan K.H., A tabu search approach to the clustering problem, Pattern Recognition, 28, pp. 1443-1451, (1995)

[2]

Babu G.P., Murty M.N., A near-optimal initial seed value selection in K-means algorithm using genetic algorithms, Pattern Recognition Lett., 14, pp. 763-769, (1993)

[3]

Beltran M., Pacheco J., Nuevos métodos para el diseño de cluster no jerárquicos, Una Aplicación a Los Municipios de Castilla Y León, 43, 148, pp. 209-224, (2001)

[4]

Brucker P., On the Complexity of Clustering Problems. Lecture Notes in Economics and Mathematical Systems, 157, pp. 45-54, (1978)

[5]

Cano F.J., Análisis de clusters o de conglomerados, I Jornadas de Matemáticas, (1999)

[6]

Diehr G., Evaluation of a branch and bound algorithm for clustering, SIAM J. Sci. Statist. Comput., 6, pp. 268-284, (1985)

[7]

du Merle O., Hansen P., Jaumard B., Mladenovic N., An interior point algorithm for minimum sum of squares clustering, SIAM J. Sci. Comput., 21, 4, pp. 1485-1505, (2000)

[8]

Feo T.A., Resende M.G.C., A probabilistic heuristic for a computationally difficult set covering problem, Oper. Res. Lett., 8, pp. 67-71, (1989)

[9]

Feo T.A., Resende M.G.C., Greedy randomized adaptive search procedures, J. Global Optim., 2, pp. 1-27, (1995)

[10]

Glover F., Tabu search: Part I. ORSA, J. Comput., 1, pp. 190-206, (1989)

← 1 2 3 →