A quantum Jensen-Shannon graph kernel for unattributed graphs

DOI10.1016/j.patcog.2014.03.028zbMath1373.68345DBLPjournals/pr/Bai0TH15OpenAlexW1973848216WikidataQ60430837 ScholiaQ60430837MaRDI QIDQ1677057

Edwin R. Hancock, Andrea Torsello, Luca Rossi, Lu Bai

Publication date: 10 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.03.028

zbMATH Keywords

quantum stategraph kernelscontinuous-time quantum walkquantum Jensen-Shannon divergence

Mathematics Subject Classification ID

Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Random walks on graphs (05C81)

Related Items (11)

A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework ⋮ Adaptive Feature Selection Based on the Most Informative Graph-Based Features ⋮ 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 walk and its application domains: a systematic review ⋮ The metric property of the quantum Jensen-Shannon divergence ⋮ 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 ⋮ Quantum Jensen-Shannon divergences between infinite-dimensional positive definite operators

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Graph kernels from the Jensen-Shannon divergence
• Quantum walks, Ihara zeta functions and cospectrality in regular graphs
• Edit distance-based kernel functions for structural pattern classification
• An example of the difference between quantum and classical random walks
• Attributed Graph Similarity from the Quantum Jensen-Shannon Divergence
• Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
• Quantum Computation and Quantum Information
• An eigendecomposition approach to weighted graph matching problems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
• A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk
• Effective graph classification based on topological and label attributes
• One-dimensional quantum walks
• Quantum walks on graphs
• An Extension of Kakutani's Theorem on Infinite Product Measures to the Tensor Product of Semifinite w ∗ -Algebras

This page was built for publication: A quantum Jensen-Shannon graph kernel for unattributed graphs