Local-global nested graph kernels using nested complexity traces
Authors:
- Lu BaiLBLu Bai
- Lixin CuiLCLixin Cui
- Luca RossiLRLuca Rossi
- Lixiang XuLXLixiang Xu
- Xiao BaiXBXiao Bai
- Edwin HancockEHEdwin Hancock
Open Access
- 1 June 2020
- journal article
- conference paper
- Published by Elsevier in Pattern Recognition Letters
- Vol. 134, 87-95
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61503422, 61602535, 61773415, 61370123, 61772057)
- Natural Science Foundation of Beijing Municipality (4162037)
This publication has 16 references indexed in Scilit:
- Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergencePhysical Review E, 2015
- A quantum Jensen–Shannon graph kernel for unattributed graphsPattern Recognition, 2015
- Depth-based complexity traces of graphsPattern Recognition, 2014
- Graph characterizations from von Neumann entropyPattern Recognition Letters, 2012
- Graph Kernels from the Jensen-Shannon DivergenceJournal of Mathematical Imaging and Vision, 2012
- A polynomial characterization of hypergraphs using the Ihara zeta functionPattern Recognition, 2011
- A shortest-path graph kernel for estimating gene product semantic similarityJournal of Biomedical Semantics, 2011
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- Quantum computation and decision treesPhysical Review A, 1998
- Theory of reproducing kernelsTransactions of the American Mathematical Society, 1950