The journey of graph kernels through two decades

被引:57
|
作者
Ghosh, Swarnendu [1 ]
Das, Nibaran [1 ]
Goncalves, Teresa [2 ]
Quaresma, Paulo [2 ]
Kundu, Mahantapas [1 ]
机构
[1] Jadavpur Univ, Dept Comp Sci, Kolkata, India
[2] Univ Evora, Dept Informat, Evora, Portugal
关键词
Graph kernels; Support vector machines; Graph similarity; Isomorphism; NETWORKS; CLASSIFICATION; MODELS;
D O I
10.1016/j.cosrev.2017.11.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the real world all events are connected. There is a hidden network of dependencies that governs behavior of natural processes. Without much argument it can be said that, of all the known data-structures, graphs are naturally suitable to model such information. But to learn to use graph data structure is a tedious job as most operations on graphs are computationally expensive, so exploring fast machine learning techniques for graph data has been an active area of research and a family of algorithms called kernel based approaches has been famous among researchers of the machine learning domain. With the help of support vector machines, kernel based methods work very well for learning with Gaussian processes. In this survey we will explore various kernels that operate on graph representations. Starting from the basics of kernel based learning we will travel through the history of graph kernels from its first appearance to discussion of current state of the art techniques in practice. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:88 / 111
页数:24
相关论文
共 50 条