Learning to Count Isomorphisms with Graph Neural Networks

02/07/2023
by   Xingtong Yu, et al.
0

Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns. Classical methods usually boil down to a backtracking framework that needs to navigate a huge search space with prohibitive computational costs. Some recent studies resort to graph neural networks (GNNs) to learn a low-dimensional representation for both the query and input graphs, in order to predict the number of subgraph isomorphisms on the input graph. However, typical GNNs employ a node-centric message passing scheme that receives and aggregates messages on nodes, which is inadequate in complex structure matching for isomorphism counting. Moreover, on an input graph, the space of possible query graphs is enormous, and different parts of the input graph will be triggered to match different queries. Thus, expecting a fixed representation of the input graph to match diversely structured query graphs is unrealistic. In this paper, we propose a novel GNN called Count-GNN for subgraph isomorphism counting, to deal with the above challenges. At the edge level, given that an edge is an atomic unit of encoding graph structures, we propose an edge-centric message passing scheme, where messages on edges are propagated and aggregated based on the edge adjacency to preserve fine-grained structural information. At the graph level, we modulate the input graph representation conditioned on the query, so that the input graph can be adapted to each query individually to improve their matching. Finally, we conduct extensive experiments on a number of benchmark datasets to demonstrate the superior performance of Count-GNN.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching

Graph neural networks (GNNs) and message passing neural networks (MPNNs)...
research
09/10/2023

Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power

The ability of graph neural networks (GNNs) to count certain graph subst...
research
02/18/2022

Interactive Visual Pattern Search on Graph Data via Graph Representation Learning

Graphs are a ubiquitous data structure to model processes and relations ...
research
02/10/2020

Can graph neural networks count substructures?

The ability to detect and count certain substructures in graphs is impor...
research
06/16/2020

Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting

While Graph Neural Networks (GNNs) have achieved remarkable results in a...
research
04/01/2021

Sub-GMN: The Subgraph Matching Network Model

As one of the most fundamental tasks in graph theory, subgraph matching ...
research
10/20/2022

Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks

The graph retrieval problem is to search in a large corpus of graphs for...

Please sign up or login with your details

Forgot password? Click here to reset