A nested alignment graph kernel through the dynamic time warping framework
From MaRDI portal
Recommendations
Cites work
- A comparison of explicit and implicit graph embedding methods for pattern recognition
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Depth-based complexity traces of graphs
- Depth-based hypergraph complexity traces from directed line graphs
- Fast depth-based subgraph kernels for unattributed graphs
- Graph classification and clustering based on vector space embedding.
- Graph kernels from the Jensen-Shannon divergence
- scientific article; zbMATH DE number 6378008 (Why is no real title available?)
This page was built for publication: A nested alignment graph kernel through the dynamic time warping framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082143)