Fast computation of graph kernels
Using extensions of linear algebra concepts to Reproducing Kernel Hilbert Spaces (RKHS), we define a unifying framework for random walk kernels on graphs. Reduction to a Sylvester equation allows us to compute many of these kernels in O(n3) worst-case time. This includes kernels whose previous worst-case time complexity was O(n6), such as the geometric kernels of Gärtner et al.  and the marginal graph kernels of Kashima et al. . Our algebra in RKHS allow us to exploit sparsity in directed...[Show more]
|Collections||ANU Research Publications|
|Source:||Advances in Neural Information Processing Systems 19|
|01_Vishwanathan_Fast_computation_of_graph_2007.pdf||379.9 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.