Uncertainty modeling for inductive knowledge graph embedding

被引:0
作者
Liu, Chao [1 ]
Kwong, Sam [3 ]
Wang, Xizhao [1 ,2 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Shenzhen Univ, Guangdong Key Lab Intelligent Informat Proc, Shenzhen 518060, Peoples R China
[3] Lingnan Univ, Dept Comp & Decis Sci, Hong Kong 999077, Peoples R China
关键词
Distribution shift; Embedding space; Graph representation learning; Reconstruction; Inductive link prediction;
D O I
10.1016/j.neunet.2024.107103
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the process of refining Knowledge Graphs (KGs), new entities emerge, and old entities evolve, which usually updates their attribute information and neighborhood structures. This results in a distribution shift problem for entity features in the embedding space during graph representation learning. Most of existing inductive knowledge graph embedding methods focus mainly on the representation learning of new entities, neglecting the negative impact caused by distribution shift of entity features. In this paper, we use the skill of mean and variance reconstruction to develop a novel inductive knowledge graph embedding model named EDSU for processing the shift of entity feature distribution. Specifically, by assuming that the embedding feature of entity follows multivariate Gaussian distribution, the reconstruction combines the distribution characteristics of components in an entity embedding vector with neighborhood structure information of a set of entity embedding vectors, in order to alleviate the deviation of data information between intra-entity and inter-entity. Furthermore, the connection between the entity features distributions before and after the shift is established, which guides the model training process and provides an interpretation on the rationality of such handling distribution shift in view of distributional data augmentation. Extensive experiments have been conducted and the results demonstrate that our EDSU model outperforms previous state-of-the-art baseline models on inductive link prediction tasks.
引用
收藏
页数:11
相关论文
共 49 条
  • [1] Bojchevski A., 2018, ICLR
  • [2] Bordes A., 2013, ADV NEURAL INFORM PR, V26, P2787, DOI DOI 10.5555/2999792.2999923
  • [3] Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces
    Cao, Jiahang
    Fang, Jinyuan
    Meng, Zaiqiao
    Liang, Shangsong
    [J]. ACM COMPUTING SURVEYS, 2024, 56 (06)
  • [4] Data Uncertainty Learning in Face Recognition
    Chang, Jie
    Lan, Zhonghao
    Cheng, Changmao
    Wei, Yichen
    [J]. 2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, : 5709 - 5718
  • [5] Chen JJ, 2021, AAAI CONF ARTIF INTE, V35, P6271
  • [6] Chen MY, 2023, PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, P6574
  • [7] Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding
    Chen, Mingyang
    Zhang, Wen
    Zhu, Yushan
    Zhou, Hongting
    Yuan, Zonggang
    Xu, Changliang
    Chen, Huajun
    [J]. PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 927 - 937
  • [8] Chen XL, 2019, AAAI CONF ARTIF INTE, P3363
  • [9] Chen ZM, 2021, AAAI CONF ARTIF INTE, V35, P4019
  • [10] Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811