A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework
From MaRDI portal
Publication:5082143
DOI10.1007/978-3-319-58961-9_6zbMath1489.68181OpenAlexW2610822161WikidataQ60430798 ScholiaQ60430798MaRDI QIDQ5082143
Luca Rossi, Lu Bai, Edwin R. Hancock, Lixin Cui
Publication date: 15 June 2022
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://eprints.whiterose.ac.uk/114048/1/paper_24.pdf
Cites Work
- Unnamed Item
- Graph kernels from the Jensen-Shannon divergence
- Depth-based complexity traces of graphs
- Fast depth-based subgraph kernels for unattributed graphs
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Depth-based hypergraph complexity traces from directed line graphs
- Attributed Graph Similarity from the Quantum Jensen-Shannon Divergence
- Graph Classification and Clustering Based on Vector Space Embedding
- A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition
This page was built for publication: A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework