Graph kernels from the Jensen-Shannon divergence

DOI10.1007/S10851-012-0383-6MaRDI QIDQ385342zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lu Bai, Edwin R. Hancock

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

zbMATH Keywords

entropydivergencegraph kernelJensen-Shannon kernel

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Machine vision and scene understanding (68T45)

Recommendations

• A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
• A quantum Jensen-Shannon graph kernel for unattributed graphs
• Nonextensive information theoretic kernels on measures
• Graph kernels
• Fast depth-based subgraph kernels for unattributed graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 2116058 (Why is no real title available?)
• scientific article; zbMATH DE number 3284914 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Riemannian approach to graph embedding
• Diffusion kernels on statistical manifolds
• Generalized median graph computation by means of graph embedding in vector spaces
• Graph characteristics from the heat kernel trace
• Graph embedding using tree edit-union
• Graph matching using the interference of continuous-time quantum walks
• Measures of statistical complexity: why?
• Nonextensive information theoretic kernels on measures
• Probability product kernels
• Quantum walks, Ihara zeta functions and cospectrality in regular graphs
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

Cited in

(13)

• Graph characterization by counting sink star subgraphs
• A multiple attributes convolution kernel with reproducing property
• The resistance perturbation distance: a metric for the analysis of dynamic networks
• Depth-based hypergraph complexity traces from directed line graphs
• A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
• The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels
• A nested alignment graph kernel through the dynamic time warping framework
• Nonextensive information theoretic kernels on measures
• Depth-based complexity traces of graphs
• Fast depth-based subgraph kernels for unattributed graphs
• A quantum Jensen-Shannon graph kernel for unattributed graphs
• A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
• A combined Weisfeiler-Lehman graph kernel for structured data

This page was built for publication: Graph kernels from the Jensen-Shannon divergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385342)