Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs

Thanh Hoang-Minh
7/5/2025
cs.LG

No official code found. Best implementation: hmthanh/GCAT (3 stars, MIT, last commit 2025-07-05).

Abstract

Knowledge graphs offer a structured representation of real-world entities and their relationships, enabling a wide range of applications from information retrieval to automated reasoning. In this paper, we conduct a systematic comparison between traditional rule-based approaches and modern deep learning methods for link prediction. We focus on KBGAT, a graph neural network model that leverages multi-head attention to jointly encode both entity and relation features within local neighborhood structures. To advance this line of research, we introduce \textbf{GCAT} (Graph Collaborative Attention Network), a refined model that enhances context aggregation and interaction between heterogeneous nodes. Experimental results on four widely-used benchmark datasets demonstrate that GCAT not only consistently outperforms rule-based methods but also achieves competitive or superior performance compared to existing neural embedding models. Our findings highlight the advantages of attention-based architectures in capturing complex relational patterns for knowledge graph completion tasks.

View on arXivView PDF

Code Implementations(1)

hmthanh/GCATCommunity100%
MIT

Graph Collaborate Attention Network

30Shell, PythonAug 31, 20201 years agoMIT

Similar Papers

Cite this paper

@article{hoangminh2025graph,
  title  = {Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs},
  author = {Thanh Hoang-Minh},
  year   = {2025},
  eprint = {2507.03947},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.03947v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.03947.svg)](https://codeofpaper.com/paper/2507.03947)

Discussion