Approximate Subgraph Matching with Neural Graph Representations and Reinforcement Learning
Kaiyang Li, Shihao Ji, Zhipeng Cai, Wei Li

TL;DR
This paper introduces a novel reinforcement learning approach using graph transformers for approximate subgraph matching, significantly improving accuracy and efficiency over existing heuristic methods.
Contribution
It presents a reinforcement learning algorithm that leverages graph transformers and imitation learning to enhance approximate subgraph matching performance.
Findings
Outperforms existing methods in effectiveness
Achieves higher efficiency in large graphs
Demonstrates robustness on real-world datasets
Abstract
Approximate subgraph matching (ASM) is a task that determines the approximate presence of a given query graph in a large target graph. Being an NP-hard problem, ASM is critical in graph analysis with a myriad of applications ranging from database systems and network science to biochemistry and privacy. Existing techniques often employ heuristic search strategies, which cannot fully utilize the graph information, leading to sub-optimal solutions. This paper proposes a Reinforcement Learning based Approximate Subgraph Matching (RL-ASM) algorithm that exploits graph transformers to effectively extract graph representations and RL-based policies for ASM. Our model is built upon the branch-and-bound algorithm that selects one pair of nodes from the two input graphs at a time for potential matches. Instead of using heuristics, we exploit a Graph Transformer architecture to extract feature…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Advanced Graph Neural Networks · Data Quality and Management
