Graphlet-based lazy associative graph classification

04/21/2015
by   Yury Kashnitsky, et al.
0

The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs up to a fixed size similarly to what is done with graphlet kernels. We explain the idea of the algorithm with a toy example and describe our experiments with a predictive toxicology dataset.

READ FULL TEXT
06/27/2012

Subgraph Matching Kernels for Attributed Graphs

We propose graph kernels based on subgraph matchings, i.e. structure-pre...
07/02/2019

Isomorphism Problem for S_d-graphs

An H-graph is the intersection graph of connected subgraphs of a suitabl...
02/02/2021

Graph Classification Based on Skeleton and Component Features

Most existing popular methods for learning graph embedding only consider...
12/28/2020

Learning to predict synchronization of coupled oscillators on heterogeneous graphs

Suppose we are given a system of coupled oscillators on an arbitrary gra...
01/19/2018

Towards a Theory of Data-Diff: Optimal Synthesis of Succinct Data Modification Scripts

This paper addresses the Data-Diff problem: given a dataset and a subseq...
09/16/2020

A New Perspective of Graph Data and A Generic and Efficient Method for Large Scale Graph Data Traversal

The BFS algorithm is a basic graph data processing algorithm and many ot...
06/01/2016

Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization

We study large-scale classification problems in changing environments wh...