The journey of graph kernels through two decades
DOI10.1016/j.cosrev.2017.11.002zbMath1382.68191OpenAlexW2776454016WikidataQ56688183 ScholiaQ56688183MaRDI QIDQ1706611
Teresa Gonçalves, Nibaran Das, Swarnendu Ghosh, Mahantapas Kundu, Paulo Quaresma
Publication date: 22 March 2018
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2017.11.002
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propagation kernels: efficient graph kernels from propagated information
- Automatic learning of cost functions for graph edit distance
- Enumerating all connected maximal common subgraphs in two graphs
- Graph kernels based on tree patterns for molecules
- Edit distance-based kernel functions for structural pattern classification
- A graph distance metric based on the maximal common subgraph
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Inexact graph matching for structural pattern recognition
- A graph distance metric combining maximum common subgraph and minimum common supergraph
- Learning Theory and Kernel Machines
- Image Classification Using Marginalized Kernels for Graphs
- Algorithm 457: finding all cliques of an undirected graph
- Theory of Reproducing Kernels
- Logical Approaches to Computational Barriers
This page was built for publication: The journey of graph kernels through two decades
