Spectral techniques for graph bisection in genetic algorithms

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1249-1256

  Martin, Jacob G ^a  

^a Computer Science ^*  (United States)

Author keywords

Genetic algorithm; Genetic engineering; Graph bisection; Graph partitioning; Reduced rank approximation; Singular value decomposition; Spectral bisection

Indexed keywords

GENETIC ALGORITHMS; GENETIC ENGINEERING; MATRIX ALGEBRA; OPTIMIZATION;

GRAPH BISECTION; GRAPH PARTITIONING; REDUCED RANK APPROXIMATION; SINGULAR VALUE DECOMPOSITION; SPECTRAL BISECTION;

GRAPH THEORY;

EID: 33750249024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144193     Document Type: Conference Paper

References (50)

1. N. Alon. Spectral techniques in graph algorithms (invited paper). In LATIN'98: theoretical informatics (Campinas, 1998), volume 1380 of Lecture Notes in Comput. Sci., pages 206-215. Springer, Berlin, 1998.
2. C. J. Alpert, A. B. Kahng, and S.-Z. Yao. Spectral partitioning with multiple eigenvectors. Discrete Appl. Math., 90(1-3):3-26, 1999.
3. C. J. Alpert and S.-Z. Yao. Spectral partitioning: The more eigenvectors, the better. In DAC, pages 195-200, 1995.
4. B. Aspvall and J. R. Gilbert. Graph coloring using eigenvalue decomposition. SIAM J. Algebraic Discrete Methods, 5(4):526-538, 1984.
5. E. R. Barnes. An algorithm for partitioning the nodes of a graph. SIAM J. Algebraic Discrete Methods, 3(4):541-550, 1982.
6. M. W. Berry, Z. Drmač, and E. R. Jessup. Matrices, vector spaces, and information retrieval. SIAM Rev., 41(2):335-362 (electronic), 1999.
7. M. W. Berry, S. T. Dumais, and G. W. O'Brien. Using linear algebra for intelligent information retrieval. SIAM Rev., 37(4):573-595, 1995.
8. R. B. Boppana. Eigenvalues and graph bisection: An average-case analysis (extended abstract). In FOCS, pages 280-285, 1987.
9. M. Brand and K. Huang. A unifying theorem for spectral embedding and clustering. In International Workshop On Artificial Intelligence and Statistics, Jan. 2003. International Workshop On Artificial Intelligence and Statistics, January 2003.
10. T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171-191, 1987.
11. T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In PPSC, pages 445-452, 1993.
12. T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. Comput., 45(7):841-855, 1996.
13. D. M. Cvetkpvić, M. Doob, and H. Sachs. Spectra of graphs, volume 87 of Pure and Applied Mathematics. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1980.
14. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Pumas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
15. W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs. IBM J. Res. Develop., 17:420-425, 1973.
16. P. Drineas, A. M. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9-33, 2004.
17. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1972.
18. C. M. Fiduccia and R. M. Mattlieyses. A linear-time heuristic for improving network partitions. In DAC '82: Proceedings of the 19th conference on Design automation, pages 175-181, Piscataway, NJ, USA, 1982. IEEE Press.
19. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Math. J., 23(98):298-305, 1973.
20. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker. Query by image and video content: The QBIC system. IEEE Computer, 28(9):23-32, Sept. 1995.
21. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures Algorithms, 10(1-2):5-42, 1997.
22. M. R. Carey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1(3):237-267, 1976.
23. G.Golub and C. Reinsch. Handbook for Matrix Computation II, Linear Algebra. Springer-Verlag. 1971.
24. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Mass., 1989.
25. G. H. Golub and C. F. Van Loan. Matrix computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 1996.
26. G. R. Harik and D. E. Goldberg. Learning linkage. In Foundations of Genetic Algorithms, pages 247-262, 1996.
27. B. Hendrickson and R. W. Leland. A multi-level algorithm for partitioning graphs. In Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing, 1995.
28. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Mich., 1975.
29. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation, part i, graph partitioning. Oper. Res., 37(6):865-892, 1989.
30. C. A. Jones. Vertex and edge partitions of graphs. PhD thesis, Pennsylvania State University, University Park, PA, USA, 1992.
31. R. Kannan, S. Vempala, and A. Vetta. On clusterings: good, bad and spectral. J. ACM, 51(3):497-515 (electronic), 2004.
32. B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell Systems Journal, 49:291-307, 1972.
33. J.-P. Kim and B.-R. Moon. A hybrid genetic search for multi-way graph partitioning based on direct partitioning. In L. S. et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 408-415, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
34. Y.-H. Kim and B. R. Moon. Lock-gain based graph partitioning. J. Heuristics, 10(1):37-57, 2004.
35. H. S. Maini, K. G. Mehrotra, M. Mohan, and S. Ranka. Genetic algorithms for graph partitioning and incremental graph partitioning. Technical Report CRPC-TR94504, Center for Research on Parallel Computation, Rice University, Houston, TX, 1994.
36. J. G. Martin. Subproblem optimization by gene correlation with singular value decomposition. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1507-1514, New York, NY, USA, 2005. ACM Press.
37. J. G. Martin and K. Rasheed. Using singular value decomposition to improve a genetic algorithm's performance. In Proceedings of the 2003 Congress on Evolutionary Computation CEC2003, pages 1612-1617, Canberra, 8-12 Dec. 2003. IEEE Press.
38. R. S. Michalski. Learnable evolution model: Evolutionary processes guided by machine learning. Mach. Learn., 38(1-2):9-40, 2000.
39. C. Moler and D. Morrison. Singular value analysis of cryptograms. Amer. Math. Monthly, 90(2):78-87, 1983.
40. B. Monien. The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods, 7(4):505-512, 1986.
41. B. Noble and J. W. Daniel. Applied Linear Algebra. Prentice-Hall, Englewood Cliffs, NJ, USA, third edition, 1988.
42. C. H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala. Latent semantic indexing: a probabilistic analysis. J. Comput. System Sci., 61(2):217-235, 2000.
43. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl, 11(3):430-452, 1990.
44. K. Sastry and D. E. Goldberg. Probabilistic model building and competent genetic programming. In R. L. Riolo and B. Worzel, editors, Genetic Programming Theory and Practise, chapter 13, pages 205-220. Kluwer, 2003.
45. J. E. Savage and M. G. Wloka. Parallelism in graph-partitioning. J. Parallel Distrib: Comput., 13(3):257-272, 1991.
46. B. R. Schatz. Automated analysis of cryptogram cipher equipment. CRYPTOLOGIA, 1(2):116-142, Apr. 1977.
47. E. Schmidt. Zur Theorie der linearen und nichtlinearen Integralgleichungen. Math. Ann., 63(4):433-476, 1907.
48. A. J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optim., 29(2):225-241, 2004.
49. G. W. Stewart. On the early history of the singular value decomposition. SIAM Rev., 35(4):551-566, 1993.
50. E. R. van Dam and W. H. Haemers. Which graphs are determined by their spectrum? Linear Algebra Appl., 373:241-272, 2003.