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