基于EA-LDA算法的领域知识图谱潜在关系扩展  

Potential Relationship Extension Based on EA-LDA Algorithm for Domain-Specific Knowledge Graph

作　　者：刘昕[1] 白婷婷 张淯舒 钱茛南 何旭莉[1] 席永轲 LIU Xin;BAI Tingting;ZHANG Yushu;QIAN Gennan;HE Xuli;XI Yongke(School of Computer Science and Technology,China University of Petroleum(East China),Qingdao,Shandong 266580,China;China Academic of Electronics and Information Technology,Beijing 100086,China)

机构地区：[1]中国石油大学(华东)计算机科学与技术学院,山东青岛266580 [2]中国电子科技集团公司信息科学研究院,北京100086

出　　处：《计算机工程》2021年第10期89-96,102,共9页Computer Engineering

基　　金：中央高校基本科研业务费专项资金(20CX05018A,19CX05003A-11)。

摘　　要：在知识互联的大数据环境下,初步构建的领域知识图谱可展示该领域知识的结构化信息,但实体之间隐含的潜在关系并未在图谱中得到充分表达。为解决领域知识图谱实体关系丰富和扩展问题,提出一种基于实体间关联规则分析与主题分析的关系发现方法。应用与领域实体相关的数据,通过实体间关联规则分析与实体相关数据集间主题分布相似度分析获取领域实体间潜在关系,将新发现的关系融合到初步构建的知识图谱中,实现领域知识图谱的潜在关系扩展。实验结果表明,该方法能够发现部门实体间的共性,挖掘出隐藏在领域实体间的关系,可有效地应用于领域实体间关系发现,丰富领域知识图谱。In the Internet that produces massive data,knowledge is mutually related.A rough domain-specific knowledge graph can display the structured information of the knowledge in this domain,but usually fails to present the potential relationships between entities.To implement smooth extension of relationships between entitites in domain-specific knowledge graphs,a relationship discovery method based on inter-entity association rule analysis and topic analysis is proposed.By utilizing the entity-related data in a specific domain,the potential relationships between domain-specific entities are obtained by analyzing the association rules and the similarity of topic distribution among entity-related data sets.Then the newly discovered relationships are merged into the roughly constructed knowledge graphs to realize the potential relationship extension of the domain-specific knowledge graphs.The experimental results show that the proposed method can discover the commonalities between entities of different sectors,and thus mine the potential relationships between these entities.It improves the efficiency of relationship discovery,and smoothes the extension of domain-specific knowledge graphs.

关 键 词：领域知识图谱 潜在关系扩展 关联分析 主题分析 知识挖掘 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]