|
I am in a situation where I need to use shortest path graph kernel for shortest path graphs (FLoyed Warshall). Shortest path graph kernel is defined as the use of multiple sub kernels which includes kernel for nodes (which uses guassian kernel), kernel for edges (Brownian bridge kernel). How one can proceed with the implementation with such roadmap? |
