Fast Computation of Graph Kernels

NIPS 2006: Proceedings of the 19th International Conference on Neural Information Processing Systems

Volumn , Issue , 2006, Pages 1449-1456

  Vishwanathan, S V N ^a,b   Borgwardt, Karsten M ^c   Schraudolph, Nicol N ^a,b  

^a CSIRO   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUGATE GRADIENT METHOD; LINEAR ALGEBRA;

% REDUCTIONS; CONJUGATE-GRADIENT SOLVERS; FAST COMPUTATION; GRAPH KERNELS; RANDOM WALK; REPRODUCING KERNEL HILBERT SPACES; SYLVESTER EQUATION; TIME COMPLEXITY; UNDIRECTED GRAPH; WORST-CASE TIME;

DIRECTED GRAPHS;

EID: 85144588206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. T. Gärtner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In B. Schölkopf and M. K. Warmuth, editors, Proc. Annual Conf. Comput. Learning Theory. Springer, 2003.
2. H. Kashima, K. Tsuda, and A. Inokuchi. Kernels on graphs. In K. Tsuda, B. Schölkopf, and J. Vert, editors, Kernels and Bioinformatics, Cambridge, MA, 2004. MIT Press.
3. K. M. Borgwardt, C. S. Ong, S. Schonauer, S. V. N. Vishwanathan, A. J. Smola, and H. P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(Suppl 1):i47-i56, 2005.
4. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
5. > = E. ACM Transactions on Mathematical Software, 18(2):223-231, 1992.
6. C. F. V. Loan. The ubiquitous kronecker product. Journal of Computational and Applied Mathematics, 123:85-100, 2000.
7. J. Nocedal and S. J. Wright. Numerical Optimization. Springer Series in Operations Research, 1999.
8. G. H. Golub and C. F. Van Loan. Matrix Computations. John Hopkins University Press, Baltimore, MD, 3rd edition, 1996.