论文信息 - Iterative Methods for Low Rank Approximation of Graph Similarity Matrices - 字舞流文

Iterative Methods for Low Rank Approximation of Graph Similarity Matrices

P. Absil | P. Dooren | T. Cason

[1] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .

[2] G. Stewart. Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[3] J. Aubin,et al. APPLIED FUNCTIONAL ANALYSIS , 1981, The Mathematical Gazette.

[4] Alexandru T. Balaban,et al. Applications of graph theory in chemistry , 1985, J. Chem. Inf. Comput. Sci..

[5] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .

[6] A. Bunse-Gerstner,et al. Numerical computation of an analytic singular value decomposition of a matrix valued function , 1991 .

[7] M. KleinbergJon. Authoritative sources in a hyperlinked environment , 1999 .

[8] Ambuj K. Singh,et al. Deriving phylogenetic trees from the similarity analysis of metabolic pathways , 2003, ISMB.

[9] D. O'Shea,et al. Limits of tangent spaces to real surfaces , 2004 .

[10] Paul Van Dooren,et al. A MEASURE OF SIMILARITY BETWEEN GRAPH VERTICES . WITH APPLICATIONS TO SYNONYM EXTRACTION AND WEB SEARCHING , 2002 .

[11] Robert E. Mahony,et al. Optimization Algorithms on Matrix Manifolds , 2007 .

[12] Nicholas J. Higham,et al. Functions of matrices - theory and computation , 2008 .

[13] Paul Van Dooren,et al. Optimizing the Coupling Between Two Isometric Projections of Matrices , 2008, SIAM J. Matrix Anal. Appl..

[14] Paul Van Dooren,et al. Comparing Two Matrices by Means of Isometric Projections , 2011 .