Essentially Tight Kernels For (Weakly) Closed Graphs.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: ISAAC (2021)
Keyphrases
- graph kernels
- upper bound
- lower bound
- graph theory
- feature space
- support vector
- graph matching
- kernel function
- graph structure
- heat kernel
- graph structures
- random graphs
- graph theoretic
- graph databases
- kernel methods
- worst case
- similarity measure
- directed graph
- graph model
- spanning tree
- objective function
- feature selection
- series parallel
- machine learning