A quantum Jensen-Shannon graph kernel for unattributed graphs
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17) Random walks on graphs (05C81) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Recommendations
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Graph kernels from the Jensen-Shannon divergence
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
- An Extension of Kakutani's Theorem on Infinite Product Measures to the Tensor Product of Semifinite w ∗ -Algebras
- An eigendecomposition approach to weighted graph matching problems
- An example of the difference between quantum and classical random walks
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Edit distance-based kernel functions for structural pattern classification
- Effective graph classification based on topological and label attributes
- Finding maximum common biconnected subgraphs in series-parallel graphs
- Graph kernels from the Jensen-Shannon divergence
- Nonextensive information theoretic kernels on measures
- One-dimensional quantum walks
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum computation and quantum information. 10th anniversary edition
- Quantum walks on graphs
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
Cited in
(17)- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- The metric property of the quantum Jensen-Shannon divergence
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- Comparing large-scale graphs based on quantum probability theory
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
- Quantum walk and its application domains: a systematic review
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
- Graph kernels from the Jensen-Shannon divergence
- Preface of special issue on ``Graph-based processing for pattern recognition
- A multiple attributes convolution kernel with reproducing property
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Label generation with consistency on the graph for multi-label feature selection
- Fast depth-based subgraph kernels for unattributed graphs
- Adaptive Feature Selection Based on the Most Informative Graph-Based Features
- A nested alignment graph kernel through the dynamic time warping framework
- A combined Weisfeiler-Lehman graph kernel for structured data
- Quantum Jensen-Shannon divergences between infinite-dimensional positive definite operators
This page was built for publication: A quantum Jensen-Shannon graph kernel for unattributed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677057)
