李剑宇, 岳昆. 知识图谱中的关联实体发现[J]. 云南大学学报(自然科学版), 2021, 43(6): 1079-1085. doi: 10.7540/j.ynu.20210051
引用本文: 李剑宇, 岳昆. 知识图谱中的关联实体发现[J]. 云南大学学报(自然科学版), 2021, 43(6): 1079-1085. doi: 10.7540/j.ynu.20210051
LI Jian-yu, YUE Kun. Discovering association entities in Knowledge Graph[J]. Journal of Yunnan University: Natural Sciences Edition, 2021, 43(6): 1079-1085. DOI: 10.7540/j.ynu.20210051
Citation: LI Jian-yu, YUE Kun. Discovering association entities in Knowledge Graph[J]. Journal of Yunnan University: Natural Sciences Edition, 2021, 43(6): 1079-1085. DOI: 10.7540/j.ynu.20210051

知识图谱中的关联实体发现

Discovering association entities in Knowledge Graph

  • 摘要: 知识图谱(Knowledge Graph, KG)中的关联实体发现任务旨在为用户输入的查询实体推荐一组最相关的实体集合. 许多实体在KG中没有显式地链接,但隐式地关联在用户生成的数据中. 因此,引入用户数据可得到更加丰富的实体关联信息,利用用户与实体的交互信息(记为用户−实体数据)可提高KG关联实体发现的准确性. 基于用户−实体数据中挖掘到的频繁项,首先,构建实体关联规则(Entity Association Rule, EAR)对实体间的关联信息建模,并利用置信度评估实体间的关联强度;然后,基于分支限界法算法获得最优的实体关联规则,得到与查询实体最相关的关联实体集合. 在两个真实世界数据集上的实验结果表明,相较于传统基于KG结构的方法,EAR发现top 1关联实体的准确率分别提高了10.7%、4.1%.

     

    Abstract: The task of associative entities discovery is to provide user with top-ranked entities in Knowledge Graph (KG). Many entities are not linked explicitly in KG but actually associated in user-generated data, which could enrich entity association in KG’s query processing. In this paper, we leverage user-entity interactions (called user-entity data) to improve the accuracy of KG query processing. Upon the frequent patterns obtained from user-entity data, we construct the Entity Association Rule (EAR) to model the association between entities, and employ confidence to evaluate the strength of association between entities. Furthermore, we obtain the optimal set of EARs based on the branch and bound algorithm, and then obtain the set of association entities most relevant to the query. The experiments show that the precision of discovering the top 1 associative entity could be improved via EAR by 10.7% and 4.1% on two real-world datasets respectively, compared with the traditional KG structure-based methods.

     

/

返回文章
返回