4.7 Review

The journey of graph kernels through two decades

Journal

COMPUTER SCIENCE REVIEW
Volume 27, Issue -, Pages 88-111

Publisher

ELSEVIER
DOI: 10.1016/j.cosrev.2017.11.002

Keywords

Graph kernels; Support vector machines; Graph similarity; Isomorphism

Funding

  1. SERB (Government of India) [SB/S3/EECE/054/2016]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available