Propagation kernels: efficient graph kernels from propagated information
From MaRDI portal
Recommendations
- Graph kernels: a survey
- Graph Kernels: State-of-the-Art and Future Challenges
- Graph kernels
- Graph kernels
- The journey of graph kernels through two decades
- Kernelization using structural parameters on sparse graph classes
- Kernelization using structural parameters on sparse graph classes
- Kernels on Graphs as Proximity Measures
Cites work
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- Graph kernels
- Graph kernels based on tree patterns for molecules
- Hash kernels for structured data
- Locality-sensitive hashing scheme based on \(p\)-stable distributions
- On graph kernels: hardness results and efficient alternatives.
- Probability product kernels
- Weisfeiler-Lehman graph kernels
Cited in
(10)- A unifying view of explicit and implicit feature maps of graph kernels
- Counts-of-counts similarity for prediction and search in relational data
- GTED: Graph Traversal Edit Distance
- Binary vectors for fast distance and similarity estimation
- Locality preserving dense graph convolutional networks with graph context-aware node representations
- Fast depth-based subgraph kernels for unattributed graphs
- The journey of graph kernels through two decades
- Graph kernels: a survey
- Beyond graph neural networks with lifted relational neural networks
- Propagation on multi-relational graphs for node regression
This page was built for publication: Propagation kernels: efficient graph kernels from propagated information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298353)
