Jointly learning relevant subgraph patterns and nonlinear models of their indicators

07/09/2018
by   Ryo Shirakawa, et al.
0

Classification and regression in which the inputs are graphs of arbitrary size and shape have been paid attention in various fields such as computational chemistry and bioinformatics. Subgraph indicators are often used as the most fundamental features, but the number of possible subgraph patterns are intractably large due to the combinatorial explosion. We propose a novel efficient algorithm to jointly learn relevant subgraph patterns and nonlinear models of their indicators. Previous methods for such joint learning of subgraph features and models are based on search for single best subgraph features with specific pruning and boosting procedures of adding their indicators one by one, which result in linear models of subgraph indicators. In contrast, the proposed approach is based on directly learning regression trees for graph inputs using a newly derived bound of the total sum of squares for data partitions by a given subgraph feature, and thus can learn nonlinear models through standard gradient boosting. An illustrative example we call the Graph-XOR problem to consider nonlinearity, numerical experiments with real datasets, and scalability comparisons to naive approaches using explicit pattern enumeration are also presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2014

Sparse Learning over Infinite Subgraph Features

We present a supervised-learning algorithm from graph data (a set of gra...
research
08/19/2015

Mining Brain Networks using Multiple Side Views for Neurological Disorder Identification

Mining discriminative subgraph patterns from graph data has attracted gr...
research
12/28/2020

Fast Subgraph Matching by Exploiting Search Failures

Subgraph matching is a compute-intensive problem that asks to enumerate ...
research
12/25/2019

Neural Subgraph Isomorphism Counting

In this paper, we study a new graph learning problem: learning to count ...
research
02/13/2023

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits

We study a variant of the subgraph isomorphism problem that is of high i...
research
09/07/2023

Subgraph-based Tight Frames on Graphs with Compact Supports and Vanishing Moments

In this work, we proposed a novel and general method to construct tight ...
research
02/03/2020

Distance Metric Learning for Graph Structured Data

Graphs are versatile tools for representing structured data. Therefore, ...

Please sign up or login with your details

Forgot password? Click here to reset