Multi-objective Genetic Algorithms for grouping problems

Applied Intelligence

Volumn 33, Issue 2, 2010, Pages 179-192

  Korkmaz, Emin Erkan ^a  

^a YEDITEPE UNIVERSITY   (Turkey)

Author keywords

Data clustering; Graph coloring; Linear Linkage Encoding (LLE); Multi objective Genetic Algorithms (MOGA)

Indexed keywords

CLUSTER ANALYSIS; COMBINATORIAL OPTIMIZATION; ENCODING (SYMBOLS); GENETIC ALGORITHMS; GRAPH THEORY; SIGNAL ENCODING;

COMBINATORIAL OPTIMIZATION PROBLEMS; DATA CLUSTERING; GENETIC ALGORITHM (GAS); GRAPH COLORINGS; LINKAGE-ENCODING; MULTI-OBJECTIVE GENETIC ALGORITHM; RECOMBINATION OPERATORS; REDUNDANCY PROBLEMS;

CLUSTERING ALGORITHMS;

EID: 77956777107     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-008-0158-3     Document Type: Article

References (40)

1. C Avanthay A Hertz N Zufferey 2003 A variable neighborhood search for graph coloring Eur J Oper Res 151 2 379 388 1053.90050 10.1016/S0377-2217(02) 00832-9 2014083
2. G Babu M Murty 1993 A near-optimal initial seed value selection in k-means algorithm using a genetic algorithm Pattern Recogn Lett 14 10 763 769 0802.68116 10.1016/0167-8655(93)90058-L
3. VC Barbosa CA Assis JOD Nascimento 2004 Two novel evolutionary formulations of the graph coloring problem J Comb Optim 8 1 41 63 1057.05030 10.1023/B:JOCO.0000021937.26468.b2 2058132
4. Berkhin P (2002) Survey of clustering data mining techniques. Technical Report, Accrue Software, San Jose, CA
5. Bezdek J, Boggavarapu S (1994) Genetic algorithm guided clustering. In: Proc 1st IEEE conf on evolutionary computation, pp 34-39
6. Blake CL, Merz CJ (2000) UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/mlrepository.html, University of California, Irvine, Dept of Information and Computer Sciences
7. N Bolshakova F Azuajeb 2003 Cluster validation techniques for genome expression data Signal Process 83 4 825 833 1144.62351 10.1016/S0165-1684(02) 00475-9
8. D Brelaz 1979 New methods to color vertices of a graph Commun ACM 22 251 256 0394.05022 10.1145/359094.359101 527126 (Pubitemid 9452014)
9. Cole RM (1998) Clustering with genetic algorithms. Master's Thesis, Nedlands 6907, Australia
10. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York
11. K Deb A Pratap S Agarwal T Meyarivan 2002 A fast and elitist multiobjective genetic algorithm: Nsga-ii IEEE Trans Evol Comput 6 182 197 10.1109/4235.996017 (Pubitemid 34555372)
12. Du J, Korkmaz E, Alhajj R, Barker K (2004) Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. Lecture notes in computer science, vol 3181. Springer, Berlin, p 219
13. AE Eiben JKVD Hauw JIV Hemert 1998 Graph coloring with adaptive evolutionary algorithms J Heuristics 4 1 25 46 0912.68150 10.1023/A: 1009638304510
14. H Eskandari CD Geiger 2008 A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems J Heuristics 14 3 203 241 05366798 10.1007/s10732-007-9037-z (Pubitemid 351534263)
15. Falkenauer E (1998) Genetic algorithms and grouping problems. Wiley, New York
16. C Fleurent J Ferland 1996 Genetic and hybrid algorithms for graph coloring Ann Oper Res 63 437 461 0851.90095 10.1007/BF02125407 (Pubitemid 126729251)
17. P Franti O Virmajoki V Hautamaki 2006 Fast agglomerative clustering using a k-nearest neighbor graph IEEE Trans Pattern Anal Mach Intell 28 11 1875 1881 10.1109/TPAMI.2006.227 (Pubitemid 46405433)
18. P Galinier J-K Hao 1999 Hybrid evolutionary algorithms for graph coloring J Comb Optim 3 4 379 397 0958.90071 10.1023/A:1009823419804 1733298
19. Glover F, Parker M, Ryan J (1996) Coloring by tabu branch and bound. In: Cliques, coloring and satisfiability, second DIMACS implementation challenge. Am Math Soc, Providence, pp 285-307
20. JA Hartigan MA Wong 1979 A k-means clustering algorithm Appl Stat 28 1 100 108 0447.62062 10.2307/2346830
21. A Hertz D de Werra 1987 Using tabu search techniques for graph coloring Comput Arch 39 345 351 0626.68051
22. Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multiobjective optimization. In: Proceedings of the first IEEE conference on evolutionary computation, vol 1. New Jersey, pp 82-87
23. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall International, Englewood Cliffs
24. TL James EC Browna KB Keelinga 2007 A hybrid grouping genetic algorithm for the cell formation problem Comput Oper Res 34 2059 2079 1189.90210 10.1016/j.cor.2005.08.010 (Pubitemid 44879773)
25. DS Johnson CR Aragon LA McGeoch C Schevon 1989 Optimization by simulated annealing: an experimental evaluation. Part 1, graph partitioning Oper Res 37 6 865 892 0698.90065 10.1287/opre.37.6.865
26. Jones DA, Beltramo MA (1991) Solving partitioning problems with genetic algorithms. In: Belew LB, Booker RK (eds) Proceedings of the 4th international conference on genetic algorithms, San Diego, CA, July 1991. Morgan Kaufmann, San Moteo, pp 442-449
27. Kirovski D, Potkonjak M (1998) Efficient coloring of a large spectrum of graphs. In: Design automation conference, pp 427-432
28. J Kivijarvi P Franti O Nevalainen 2003 Self-adaptive genetic algorithm for clustering J Heuristics 9 2 113 129 10.1023/A:1022521428870
29. Korkmaz EE (2006) A two-level clustering method using linear linkage encoding. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 681-690
30. EE Korkmaz J Du R Alhajj K Barker 2006 Combining advantages of new chromosome representation scheme and multi-objective genetic algorithms for better clustering Intell Data Anal 10 2 163 182
31. K Krishna M Murty 1999 Genetic k-means algorithm IEEE Trans Syst Man Cybern Part B Cybern 29 3 433 439 10.1109/3477.764879
32. K Lee W Yoon D Baek 2006 A classification method using a hybrid genetic algorithm combined with an adaptive procedure for the pool of ellipsoids Appl Intell 25 3 293 304 10.1007/s10489-006-0108-x (Pubitemid 44701183)
33. OL Mangasarian WH Wolberg 1990 Cancer diagnosis via linear programming SIAM News 23 1 18
34. U Maulik S Bandyopadhyay 2000 Genetic algorithm-based clustering technique Pattern Recogn 33 1455 1465 10.1016/S0031-3203(99)00137-5
35. Moraglio A, Poli R (2006) Product geometric crossover. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 1018-1027
36. Mumford CL (2006) New order-based crossovers for the graph coloring problem. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 880-889
37. Murty M, Rashmin B, Bhattacharyya C (2008) Clustering based on genetic algorithms. Studies in computational intelligence, vol 98, pp 137-159
38. K Ramanathan SU Guan 2007 Clustering and combinatorial optimization in recursive supervised learning J Comb Optim 13 2 137 152 05200364 10.1007/s10878-006-9017-5 2284898 (Pubitemid 46034289)
39. Sarafis I, Zalzala AMS, Trinder P (2002) A genetic rule-based data clustering toolkit. In: Fogel DB, El-Sharkawi MA, Yao X, Greenwood G, Iba H, Marrow P, Shackleton M (eds) Proceedings of the 2002 congress on evolutionary computation CEC2002. IEEE Press, New York, pp 1238-1243
40. Ulker O, Ozcan E, Korkmaz EE (2006) Linear linkage encoding in grouping problems: Applications on graph coloring and timetabling. In: International conference on the practice and theory of automated timetabling, PATAT06, pp 303-319