Counting Kernels in Directed Graphs with Arbitrary Orientations.
Bruno JartouxPublished in: CoRR (2022)
Keyphrases
- directed graph
- random walk
- feature space
- kernel methods
- undirected graph
- transition matrix
- linear combination
- directed acyclic graph
- strongly connected
- maximum flow
- multiple kernel learning
- search algorithm
- kernel function
- kernel learning
- disjoint paths
- data sets
- graph structures
- web graph
- gaussian processes
- support vector
- social networks