arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.09628cs.AI
收藏

DisenKGAT:基于解纠缠图注意力网络的知识图谱嵌入

DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention Network

University of Science and Technology of China(中国科学技术大学);Meituan(美团);National University of Singapore(新加坡国立大学)

Junkang Wu, Wentao Shi, Xuezhi Cao, Jiawei Chen, Wenqiang Lei, Fuzheng Zhang, Wei Wu, Xiangnan He

摘要:

知识图谱补全(KGC)由于其对众多下游任务的出色贡献而成为深度学习社区关注的焦点。虽然最近已经见证了KGC的工作激增,他们仍然不足以准确地捕捉复杂的关系,因为他们采用单一的和静态的表示。在这项工作中,我们提出了一种新的解纠缠知识图谱注意力网络(DisenKGAT)的KGC,它利用微观解纠缠和宏观解纠缠,利用背后的知识图谱(KG)的表示。为了实现微观解纠缠,我们提出了一种新的关系感知聚合学习不同的组件表示。对于宏观解纠缠,我们利用互信息作为正则化来增强独立性。在解纠缠的帮助下,我们的模型能够根据给定的场景生成自适应表示。此外,我们的工作具有很强的鲁棒性和灵活性,以适应各种评分函数。在公共基准数据集上进行了广泛的实验,以验证DisenKGAT在准确性和可解释性方面优于现有方法。

英文摘要:

Knowledge graph completion (KGC) has become a focus of attention across deep learning community owing to its excellent contribution to numerous downstream tasks. Although recently have witnessed a surge of work on KGC, they are still insufficient to accurately capture complex relations, since they adopt the single and static representations. In this work, we propose a novel Disentangled Knowledge Graph Attention Network (DisenKGAT) for KGC, which leverages both micro-disentanglement and macro-disentanglement to exploit representations behind Knowledge graphs (KGs). To achieve micro-disentanglement, we put forward a novel relation-aware aggregation to learn diverse component representation. For macro-disentanglement, we leverage mutual information as a regularization to enhance independence. With the assistance of disentanglement, our model is able to generate adaptive representations in terms of the given scenario. Besides, our work has strong robustness and flexibility to adapt to various score functions. Extensive experiments on public benchmark datasets have been conducted to validate the superiority of DisenKGAT over existing methods in terms of both accuracy and explainability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑