Abstract
Graph Neural Networks (GNNs) have proven to be effective in processing and learning from graph-structured data. However, many real-world tasks require the analysis of pairs of graph-structured data, such as scene graph matching, code search, and drug-drug interaction prediction. Previous approaches for considering the interaction between these pairs of graphs have focused on the node level, leading to high computational costs and suboptimal performance. To address this issue, we propose a novel, efficient graph-level approach for extracting interaction representation using co-attention in graph pooling. Our method, Co-Attention Graph Pooling (CAGPool), shows competitive performance compared to existing methods on both classification and regression tasks on real-world datasets, while maintaining low computational complexity.
All Related Versions
Funding Information
  • National Research Foundation of Korea (NRF-2023R1A2C3004176)
  • Ministry of Science and ICT of Korea Supervised by the Institute of Information and Communications Technology Planning and Evaluation (IITP-2023-2020-0-01819)
  • Korea Health Industry Development Institute (HR20C0021(3))
  • National Research Foundation of Korea (NRF-2022R1F1A1070111)
  • Ministry of Science and ICT of Korea Supervised by the Institute of Information and Communications Technology Planning and Evaluation (IITP-2022-RS-2022-00156439)