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

Computational Statistics and Data Analysis

Volumn 43, Issue 2, 2003, Pages 235-248

  Pacheco, Joaquín ^a   Valencia, Olga ^a  

^a UNIVERSITY OF BURGOS   (Spain)

Author keywords

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

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING;

MINIMUM SUM-OF-SQUARES CLUSTERING PROBLEM;

PROBLEM SOLVING;

ALGORITHM;

EID: 0038683388     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9473(02)00224-4     Document Type: Article

References (28)

1. Al-Sultan K.H. A tabu search approach to the clustering problem Pattern Recognition 28 1995 1443 1451
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 1993 763 769
3. Beltrán, M., Pacheco, J., 2001. Nuevos métodos para el diseño de cluster no jerárquicos. Una aplicación a los municipios de Castilla y León. Estadástica Española. Instituto Nacional de Estad́stica. Vol. 43, No. 148, pp. 209-224.
4. Brucker, P., 1978. On the Complexity of Clustering Problems. Lecture Notes in Economics and Mathematical Systems, Vol. 157. Springer, Berlin, pp. 45-54.
5. Cano, F.J., 1999. Análisis de clusters o de conglomerados. I Jornadas de Matemáticas. Burgos, Octubre 1999.
6. Diehr G. Evaluation of a branch and bound algorithm for clustering SIAM J. Sci. Statist. Comput. 6 1985 268 284
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 2000 1485 1505
8. Feo T.A. Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett. 8 1989 67 71
9. Feo T.A. Resende M.G.C. Greedy randomized adaptive search procedures J. Global Optim. 2 1995 1 27
10. Glover F. Tabu search: Part I. ORSA J. Comput. 1 1989 190 206
11. Glover F. Tabu search: Part II. ORSA J. Comput. 2 1990 4 32
12. Glover F. Laguna M. Tabu Search 1997 Kluwer Academic Publishers Boston
13. Glover F. Laguna M. Tabu search Pardalos P.M. Resende M.G.C Handbook of Applied Optimization 2002 194 208 Oxford University Press Oxford
14. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning 1989 Addison-Wesley Reading, MA
15. Hansen P. Mladenovic N. An introduction to variable neighborhood search Voss S. et al. Metaheuristics Advances and Trends in Local Search Paradigms for Optimization, MIC-97 1998 433 458 Kluwer Dordrecht
16. Hansen P. Mladenovic N. J-means: a new local search heuristic for minimum sum-of-squares clustering Pattern Recognition 34 2 2001 405 413
17. Holland J.H. Adaptation in Natural and Artificial Systems 1975 University of Michigan Press Ann Arbor
18. Howard, R., 1966. Classifying a population into homogeneous groups. In: Lawerence, J.R. (Ed.), Operational Research in the Social Sciences. Tavistock Publ., London.
19. Jancey R.C. Multidimensional group analysis Austral. J. Botany 14 1966 127 130
20. Klein R.W. Dubes R.C. Experiments in projection and clustering by simulated annealing Pattern Recognition 22 1989 213 220
21. Koontz W.L.G. Narendra P.M. Fukunuga K. A branch and bound clustering algorithm IEEE Trans. Comput. C-24 1975 908 915
22. Mladenovic, N., 1995. A variable neighborhood algorithm-a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montreal, p. 112.
23. Mladenovic N. Hansen P. Variable neighborhood search Comput. Oper. Res. 24 1997 1097 1100
24. Moscato P. Memetic algorithms Pardalos P.M. Resende M.G.C. Handbook of Applied Optimization 2002 157 167 Oxford University Press Oxford
25. Moscato, P., Laguna, L., 1996. Algoritmos Genéticos. In: Diaz, A. (coord), Optimización Heuŕstica y Redes Neuronales. Paraninfo, Madrid.
26. Reinelt G. TSPLIB: a travelling salesman problem library ORSA J. Comput. 3 1991 376 384
27. Späth H. Cluster Analysis Algorithms for Data Reduction and Classification of Objects 1980 Ellis Horwood Chichester
28. Williams J.W.J. Algorithm 232: HeapSort Comm. ACM 7 1964 347