An iterated local search approach for minimum sum-of-squares clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2810, Issue , 2003, Pages 286-296

  Merz, Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENE EXPRESSION; GLOBAL OPTIMIZATION; LOCAL SEARCH (OPTIMIZATION);

CLUSTERING HEURISTICS; COMBINATORIAL OPTIMIZATION PROBLEMS; GENE EXPRESSION DATA; HEURISTIC OPTIMIZATION; ITERATED LOCAL SEARCH; MICROARRAY EXPERIMENTS; MINIMUM SUM-OF-SQUARES CLUSTERING; OPTIMUM SOLUTION;

OPTIMIZATION;

EID: 33748328562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45231-7_27     Document Type: Article

References (26)

1. Brucker, P.: On the Complexity of Clustering Problems. Lecture Notes in Economics and Mathematical Systems 157 (1978) 45-54
2. Grötschel, M., Wakabayashi, Y.: A Cutting Plane Algorithm for a Clustering Problem. Mathematical Programming 45 (1989) 59-96
3. Hansen, P., Jaumard, B.: Cluster Analysis and Mathematical Programming. Mathematical Programming 79 (1997) 191-215
4. Zhang, M.: Large-scale Gene Expression Data Analysis: A New Challenge to Computational Biologists. Genome Research 9 (1999) 681-688
5. Brazma, A., Vilo, J.: Gene Expression Data Analysis. FEBS Letters 480 (2000) 17-24
6. Eisen, M., Spellman, P., Botstein, D., Brown, P.: Cluster Analysis and Display of Genome-wide Expression Patterns. In: Proceedings of the National Academy of Sciences, USA. Volume 95. (1998) 14863-14867
7. Tavazoie, S., Hughes, J.D., Campbell, M.J., Cho, R.J., Church, G.M.: Systematic Determination of Genetic Network Architecture. Nature Genetics 22 (1999) 281-285
8. Yeung, K., Haynor, D., Ruzzo, W.: Validating Clustering for Gene Expression Data. Bioinformatics 17 (2001) 309-318
9. Bradley, P.S., Fayyad, U.M.: Refining Initial Points for k-Means Clustering. In: Proc. 15th International Conf. on Machine Learning, Morgan Kaufmann, San Francisco, CA (1998) 91-99
10. Penã, J.M., Lozano, J.A., Larranaga, P.: An Empirical Comparison of Four Initialization Methods for the k-Means Algorithm. Pattern Recognition Letters 20 (1999) 1027-1040
11. Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study. In Aarts, E.H.L., Lenstra, J.K., eds.: Local Search in Combinatorial Optimization. Wiley and Sons, New York (1997) 215-310
12. Lourenco, H.R., Martin, O., Stutzle, T.: Iterated Local Search. In Glover, F., Kochenberger, G., eds.: Handbook of Metaheuristics. Kluwer Academic Publishers (2003)
13. Moscato, P.: Memetic Algorithms: A Short Introduction. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization. McGraw-Hill, London (1999) 219-234
14. Merz, P., Freisleben, B.: Memetic Algorithms for the Traveling Salesman Problem. Complex Systems 13 (2001) 297-345
15. Forgy, E.W.: Cluster Analysis of Multivariate Data: Efficiency vs. Interpretability of Classifications. Biometrics 21 (1965) 768-769
16. MacQueen, J.: Some Methods of Classification and Analysis of Multivariate Observations. In: Proceedings of the Fifth Berkeley Symposium on Mathemtical Statistics and Probability. (1967) 281-297
17. Alsabti, K., Ranka, S., Singh, V.: An Efficient Space-Partitioning Based Algorithm for the k-Means Clustering. In Zhong, N., Zhou, L., eds.: Proceedings of the 3rd Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining (PAKDD-99). Volume 1574 of Lecture Notes in Artificial Intelligence., Berlin, Springer (1999) 355-359
18. Pelleg, D., Moore, A.: Accelerating Exact k-Means Algorithms with Geometric Reasoning. In Chaudhuri, S., Madigan, D., eds.: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, ACM Press (1999) 277-281
19. Likas, A., Vlassis, N., Verbeek, J.J.: The Global k-Means Clustering Algorithm. Pattern Recognition (36)
20. Pelleg, D., Moore, A.: X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In: Proc. 17th International Conf. on Machine Learning, Morgan Kaufmann, San Francisco, CA (2000) 727-734
21. Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, S., Dmitrovsky, E., Lander, E.S., Golub, T.R.: Interpreting Patterns of Gene Expression with Self-organizing Maps: Methods and Application to Hematopoietic Differentiation. In: Proceedings of the National Academy of Sciences, USA. Volume 96. (1999) 2907-2912
22. Cho, R.J., Campbell, M.J., Winzeler, E.A., Conway, S., Wodicka, L., Wolfsberg, T.G., Gabrielian, A.E., Landsman, D., Lockhart, D.J., Davis, R.W.: A Genome-wide Transcriptional Analysis of the Mitotic Cell Cycle. Molecular Cell 2 (1998) 65-73
23. Merz, P., Zell, A.: Clustering Gene Expression Profiles with Memetic Algorithms. In et al., J.J.M.G., ed.: Proceedings of the 7th International Conference on Parallel Problem Solving from Nature, PPSN VII. Lecture Notes in Computer Science 2439, Springer, Berlin, Heidelberg (2002) 811-820.
24. Xu, Y., Olman, V., Xu, D.: Clustering Gene Expression Data using a Graph-Theoretic Approach: An Application of Minimum Spanning Trees. Bioinformatics 18 (2002) 536-545
25. Merz, P., Preisleben, B.: Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning. Evolutionary Computation 8 (2000) 61-91
26. Merz, P., Katayama, K.: Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem. Bio Systems (2002) To appear.