IGFM: An Enhanced Graph Similarity Computation Method with Fine-Grained Analysis

Apr 8, 2025·
Min Pei
Jianke Yu
Jianke Yu
,
Chen Chen
,
Hanchen Wang
,
Xiaoyang Wang
,
Ying Zhang
· 1 min read
CCF-B CAS Zone 1 Top JCR Q2
Abstract
Abstract In the rapidly advancing field of graph-based applications, accurate graph similarity computing (GSC) has become increasingly important. However, due to the complexity of graph structures, this task remains a challenge because of the intricate calculations involved. To solve the limitations of existing works, this paper introduces the Interpretable Graph Fusion Model (), a novel framework designed to enhance the accuracy and efficiency of graph similarity computation. Specifically, our model can fully utilize graph structure information and comprehensively assess graph similarity at both fine-grained and coarse-grained levels, ultimately achieving more accurate predictions. Experimented extensively across four real-world datasets, demonstrates a significant improvement over existing SOTA methods to solve the GSC challenge. In numerous experimental tests, our model shows performance improvements in terms of MSE (Mean Squared Error), ranging from 4.66% to as much as 56.92% compared to the second-best method.
Type
Publication
Data Science and Engineering
Status
Peer-reviewed Open access
Awards
CCF-B
Data Science and Engineering · 2025
CAS Zone 1 Top
Data Science and Engineering · 2025
JCR Q2
Data Science and Engineering · 2025
publications

Data Science and Engineering, 2025

Abstract In the rapidly advancing field of graph-based applications, accurate graph similarity computing (GSC) has become increasingly important. However, due to the complexity of graph structures, this task remains a challenge because of the intricate calculations involved. To solve the limitations of existing works, this paper introduces the Interpretable Graph Fusion Model (), a novel framework designed to enhance the accuracy and efficiency of graph similarity computation. Specifically, our model can fully utilize graph structure information and comprehensively assess graph similarity at both fine-grained and coarse-grained levels, ultimately achieving more accurate predictions. Experimented extensively across four real-world datasets, demonstrates a significant improvement over existing SOTA methods to solve the GSC challenge. In numerous experimental tests, our model shows performance improvements in terms of MSE (Mean Squared Error), ranging from 4.66% to as much as 56.92% compared to the second-best method.

Jianke Yu
Authors
Jianke Yu (he/him)
PhD (2026) in Graph Machine Learning & Databases
I completed my PhD at the University of Technology Sydney (UTS) in 2026, supervised by Prof. Ying Zhang, Prof. Lu Qin and Dr Hanchen Wang. My research develops machine learning algorithms for graph-structured data and database systems — graph neural network architectures, and learning-based methods that improve database and data-mining algorithms (fraud detection, graph similarity, supergraph search, malware detection). My work has appeared in KDD and IEEE TKDE. I am joining Zhejiang Gongshang University as a faculty member in 2027.