Graph Kernels

Gupta, A (2012) Graph Kernels. Masters thesis, Indian Institute of Technology, Hyderabad.

[img] Text
CS10M01.pdf - Submitted Version
Restricted to Registered users only until 15 November 2016.

Download (1MB) | Request a copy

Abstract

Data Mining and Machine Learning are in the midst of a \structured revolution" [1]. As we can represent almost anything using graphs, learning and data mining on graphs have become a challenge in various applications. The main algorithmic diculty in these areas, measuring similarity of graphs, has therefore received signicant attention in recent past. Graph kernels proposes a theoretically sound and promising approach to the problem of graph comparison. These kernels should respect the information represented by the topology of the graphs, while being ecient to compute. Graph kernel are used in elds like machine learning, data mining, language processing and bioinformatics. Some of the existing graph kernel methods doesn't include topological information or have runtime issues or they do not scale to large graphs. The primary goal of this thesis is to propose a graph kernel which is ecient to compute and can work accurately on large graphs. In this thesis we analyze existing graph kernels and their drawbacks. Then we propose a graph kernel, based on counting connected size-k graphlets [2]. We conducted experiments on various graphs to test accuracy of our graph kernel.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Thesis (Masters)
Uncontrolled Keywords: TD38
Subjects: Computer science > Big Data Analytics
Divisions: Department of Computer Science & Engineering
Depositing User: Team Library
Date Deposited: 03 Nov 2014 03:35
Last Modified: 16 Nov 2015 06:45
URI: http://raiith.iith.ac.in/id/eprint/600
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 600 Statistics for this ePrint Item