GAEAT: Graph Auto-Encoder Attention Networks for Knowledge Graph Completion

被引:5
作者
Han, Yanfei [1 ]
Fang, Quan [2 ,3 ]
Hu, Jun [2 ]
Qian, Shengsheng [2 ,3 ]
Xu, Changsheng [2 ,3 ,4 ]
机构
[1] Zhengzhou Univ, Zhengzhou, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing, Peoples R China
[3] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing, Peoples R China
[4] Peng Cheng Lab, Shenzhen, Peoples R China
来源
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT | 2020年
基金
中国国家自然科学基金;
关键词
Knowledge Graph Embedding; Link Prediction; Knowledge Graph Completion; Graph Attention Mechanism; Graph Auto-encoder Attention Network;
D O I
10.1145/3340531.3412148
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Knowledge graph embedding (KGE) encodes components of a KG including entities and relations into continuous low vector space. Most existing methods focus on treating entities and relations in triples independently and thus failing to capture the complex and hidden information that is inherently implicit inside the local neighborhood surrounding a triple. In this paper, we present a new approach for knowledge graph completion called GAEAT (Graph Auto-encoder Attention Network Embedding), which can encapsulate both entity and relation features. Specifically, we construct a triple-level auto-encoder by extending graph attention mechanisms to obtain latent representations of entities and relations simultaneously. To justify our proposed model, we evaluate GAEAT on two real-world datasets. The experimental results demonstrate that GAEAT can outperform state-of-the-art KGE models in knowledge graph completion task, which validates the effectiveness of GAEAT. The source code of this paper can be obtained from https://github.com/TomersHan/GAEAT.
引用
收藏
页码:2053 / 2056
页数:4
相关论文
共 11 条
  • [1] [Anonymous], 2016, ICML 2016
  • [2] Bordes A., 2013, NIPS 2013
  • [3] Guo Lingbing, 2019, ICML 2019
  • [4] Hamilton William L., 2018, EMBEDDING LOGICAL QU, P2030
  • [5] Liu HX, 2017, PR MACH LEARN RES, V70
  • [6] Nguyen D., 2018, P 2018 C N AM CHAPT, P327, DOI [DOI 10.18653/V1/N18-2053, 10.18653/v1/n18-2053]
  • [7] Schlichtkrull Michael, 2018, Modeling Relational Data with Graph Convolutional Networks, V10843
  • [8] Vaswani A, 2017, ADV NEUR IN, V30
  • [9] Yang B., 2015, INT C LEARN REPR
  • [10] Graph Convolutional Neural Networks for Web-Scale Recommender Systems
    Ying, Rex
    He, Ruining
    Chen, Kaifeng
    Eksombatchai, Pong
    Hamilton, William L.
    Leskovec, Jure
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 974 - 983