arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.04909cs.CLcs.LG
收藏

Edge:使用外部文本丰富知识图谱嵌入

Edge: Enriching Knowledge Graph Embeddings with External Text

University of Georgia(佐治亚大学);Adobe Research(Adobe研究院)

Saed Rezayi, Handong Zhao, Sungchul Kim, Ryan A. Rossi, Nedim Lipka, Sheng Li

摘要:

知识图谱具有稀疏性,这降低了由各种方法生成的表示的质量。虽然在整个网络和许多现有的知识库中有大量的文本信息,但在这些不同的数据源中对齐信息仍然是文献中的一个挑战。以前的工作已经部分解决了这个问题,丰富的知识图谱实体的基础上“硬”的词出现在知识图谱和外部文本的实体,而我们实现“软”的增强,提出了一个知识图谱丰富和嵌入框架命名边缘。给定一个原始的知识图谱,我们首先生成一个丰富的,但噪声增强图使用外部文本在语义和结构层次。为了提取相关知识并抑制引入的噪声,我们在原始图和增强图之间的共享嵌入空间中设计了图对齐项。为了增强在增强图上的嵌入学习,我们进一步基于负采样正则化目标实体的局部关系。在四个基准数据集上的实验结果表明,Edge算法在链接预测和节点分类中具有良好的鲁棒性和有效性.

英文摘要:

Knowledge graphs suffer from sparsity which degrades the quality of representations generated by various methods. While there is an abundance of textual information throughout the web and many existing knowledge bases, aligning information across these diverse data sources remains a challenge in the literature. Previous work has partially addressed this issue by enriching knowledge graph entities based on "hard" co-occurrence of words present in the entities of the knowledge graphs and external text, while we achieve "soft" augmentation by proposing a knowledge graph enrichment and embedding framework named Edge. Given an original knowledge graph, we first generate a rich but noisy augmented graph using external texts in semantic and structural level. To distill the relevant knowledge and suppress the introduced noise, we design a graph alignment term in a shared embedding space between the original graph and augmented graph. To enhance the embedding learning on the augmented graph, we further regularize the locality relationship of target entity based on negative sampling. Experimental results on four benchmark datasets demonstrate the robustness and effectiveness of Edge in link prediction and node classification.

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

↑