Graph kernels from the Jensen-Shannon divergence
From MaRDI portal
Publication:385342
DOI10.1007/s10851-012-0383-6zbMath1276.68152OpenAlexW1979856345WikidataQ60430916 ScholiaQ60430916MaRDI QIDQ385342
Publication date: 2 December 2013
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-012-0383-6
Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Machine vision and scene understanding (68T45)
Related Items (10)
Graph characterization by counting sink star subgraphs ⋮ A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework ⋮ 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 ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ Depth-based complexity traces of graphs ⋮ A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks ⋮ A combined Weisfeiler–Lehman graph kernel for structured data ⋮ A multiple attributes convolution kernel with reproducing property
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- A Riemannian approach to graph embedding
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Graph embedding using tree edit-union
- Generalized median graph computation by means of graph embedding in vector spaces
- Graph matching using the interference of continuous-time quantum walks
- Measures of statistical complexity: why?
- Graph characteristics from the heat kernel trace
This page was built for publication: Graph kernels from the Jensen-Shannon divergence
