计算机科学
知识图
谓词(数理逻辑)
自然语言处理
人工智能
向量空间
相似性(几何)
实体链接
源代码
情报检索
理论计算机科学
程序设计语言
知识库
几何学
数学
图像(数学)
作者
Rui Zhang,Yixin Su,Bayu Distiawan Trisedya,Xiaoyan Zhao,Min Yang,Hong Cheng,Jianzhong Qi
标识
DOI:10.1109/tkde.2023.3325484
摘要
The task of entity alignment between knowledge graphs (KGs) aims to identify every pair of entities from two different KGs that represent the same entity. Many machine learning-based methods have been proposed for this task. However, to our best knowledge, existing methods all require manually crafted seed alignments, which are expensive to obtain. In this paper, we propose the first fully automatic alignment method named AutoAlign, which does not require any manually crafted seed alignments. Specifically, for predicate embeddings, AutoAlign constructs a predicate-proximity-graph with the help of large language models to automatically capture the similarity between predicates across two KGs. For entity embeddings, AutoAlign first computes the entity embeddings of each KG independently using TransE, and then shifts the two KGs' entity embeddings into the same vector space by computing the similarity between entities based on their attributes. Thus, both predicate alignment and entity alignment can be done without manually crafted seed alignments. AutoAlign is not only fully automatic, but also highly effective. Experiments using real-world KGs show that AutoAlign improves the performance of entity alignment significantly compared to state-of-the-art methods. Our source code is available at ruizhang-ai/AutoAlign.
科研通智能强力驱动
Strongly Powered by AbleSci AI