Subproblem optimization by correlation with singular value decomposition

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1507-1514

  Martin, Jacob G ^a  

^a Computer Science ^*  (United States)

Author keywords

Gene decomposition; Genetic algorithm; Graph bisection; Graph clustering; Graph partitioning; Linkage learning; Probabilistic model building, genetic engineering; Reduced rank approximation; Singular value decomposition; Spectral clustering

Indexed keywords

GENE DECOMPOSITION; GRAPH BISECTION; GRAPH CLUSTERING; GRAPH PARTITIONING; LINKAGE LEARNING; PROBABILISTIC MODEL BUILDING, GENETIC ENGINEERING; REDUCED RANK APPROXIMATION; SINGULAR VALUE DECOMPOSITION; SPECTRAL CLUSTERING;

GENETIC ALGORITHMS; GRAPH THEORY; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; OPTIMIZATION;

PROBLEM SOLVING;

EID: 32444436123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068247     Document Type: Conference Paper

References (39)

1. Alon. Eigenvalues and expanders. COMBINAT: Combinatorica, 6, 1986.
2. I, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory. Series B, 38:73-88, 1985.
3. Y. Azar, A. Fiat, A. Karlin, M. McSherry, and J. Saia. Spectral analysis of data. In ACM, editor, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing: Hersonissos, Crete, Greece, July 6-8, 2001, pages 619-626, New York, NY, USA, 2001. ACM Press.
4. E. Beltrami. Sulle funzioni bilineari. Giornale di Matematiche ad Uso degli Studenti Delle Universita, 11:98-106, 1873.
5. An English translation by D. Boley is available in Technical Report 90-37, Department of Computer Science, University of Minnesota, Minneapolis, 1990.
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 Review, 37(4):573-595, Dec. 1995.
8. M. Brand and K. Huang. A unifying theorem for spectral embedding and clustering. citeseer.ist.psu.edu/669050.html.
9. T. N. Bui, F. T. Leighton, S. Chaudhuri, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171-191, 1987.
10. T. N. Bui and B. R. Moon. Genetic algorithms and graph partitioning. IEEE Transactions on Computers, 45(7):841-855, July 1996.
11. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Fumas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
12. C. Ding. A similarity-based probability model for latent semantic indexing. In Proceedings of 22nd ACM SIGIRConference, 1999.
13. Drineas, Frieze, Kannan, Vempala, and Vinay. Clustering large graphs via the singular value decomposition. MACHLEARN: Machine Learning, 56, 2004.
14. R. Duda and P. Hart. Pattern Classification and Scnene Analysis. Wiley, 1973.
15. C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1:211-218, 1936.
16. A. Fiat, A. R. Karlin, F. Mcsherry, J. Saia, and Y. Azar. Spectral analysis of data, Dec. 05 2000.
17. 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. Computer, 28(9):23-32, Sept. 1995.
18. M. R. Garey, D. S. Johnson, and S. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
19. G.Golub and C. Reinsch. Handbook for Matrix Computation II, Linear Algebra. Springer-Verlag, 1971.
20. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Mass., 1989.
21. D. E. Goldberg and G. R. Harik. Learning linkage, Aug. 29 1996.
22. G. H. Golub and C. F. Van Loan. Matrix Computation. John Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, Maryland, third edition, 1996.
23. J. H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan, 1975.
24. R. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, UK, 1991.
25. C. Jordan. Mémoire sur les formes bilinéaires. Journal de Mathématiques Pures et Appliquées, Deuxiéme Série, 19:35-54, 1874.
26. B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell Systems Journal, 49:291-307, 1972.
27. 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.
28. 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.
29. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996. Contains introductory chapter on LCS.
30. R. S. Michalski. Learnable evolution model: Evolutionary processes guided by machine learning. Mach. Learn., 38 (1-2):9-40, 2000.
31. C. B. Moler and D. Morrison. Singular value analysis of cryptograms. American Mathematical Monthly, 90(2):78-87, 1983.
32. B. Nobel. Applied Linear Algebra. Prentice-Hall, 1998.
33. C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala. Latent semantic indexing: A probabilistic analysis. In ACM, editor, PODS '98. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington, pages 159-168, New York, NY 10036, USA, 1998. ACM Press.
34. 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.
35. E. Schmidt. Zur Theorie der linearen und nichtlinearen Integralgleichungen. I Teil. Entwicklung willkürlichen Funktionen nach System vorgeschriebener. Mathematische Annalen, 63:433-476, 1907.
36. G. W. Stewart. On the early history of the singular value decomposition. SIAM Rev., 35(4):551-566, 1993.
37. J. J. Sylvester. On the reduction of a bilinear quantic of the n order to the form of a sum of n products by a double orthogonal substitution. Messenger of Mathematics, 19:42-46, 1889.
38. A. Vetta, R. Kannan, and S. Vempala. On clusterings: Good, bad and spectral, July 31 2001.
39. H. Weyl. Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung). Mathematische Annalen, 71:441-479, 1912.