Subgraph Structure
Subgraph structure analysis focuses on identifying and utilizing recurring patterns within the local neighborhoods of nodes in graphs, aiming to improve the performance of graph neural networks (GNNs) and enhance their ability to learn complex relationships. Current research emphasizes developing efficient algorithms for subgraph extraction and embedding, often incorporating techniques like random walks, spectral methods, and message-passing mechanisms within novel GNN architectures such as those based on transformers or incorporating subgraph information into existing models. This work is significant because improved subgraph analysis can lead to more accurate and efficient solutions for various applications, including knowledge graph completion, protein structure analysis, and fraud detection in financial networks.
Papers
Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization
Kaixuan Chen, Shunyu Liu, Tongtian Zhu, Tongya Zheng, Haofei Zhang, Zunlei Feng, Jingwen Ye, Mingli Song
Improving Expressivity of Graph Neural Networks using Localization
Anant Kumar, Shrutimoy Das, Shubhajit Roy, Binita Maity, Anirban Dasgupta