The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Graph Kernels
[article]
2008
arXiv
pre-print
We present a unified framework to study graph kernels, special cases of which include the random walk graph kernel GaeFlaWro03,BorOngSchVisetal05, marginalized graph kernel KasTsuIno03,KasTsuIno04,MahUedAkuPeretal04, and geometric kernel on graphs Gaertner02. Through extensions of linear algebra to Reproducing Kernel Hilbert Spaces (RKHS) and reduction to a Sylvester equation, we construct an algorithm that improves the time complexity of kernel computation from O(n^6) to O(n^3). When the
arXiv:0807.0093v1
fatcat:s4zdxsd32fd4xmloezwbja6324