期刊文献+

基于互信息的知识图谱实体关联关系建模与补全 被引量:4

Mutual Information Based Modeling and Completion of Correlations in Knowledge Graphs
在线阅读 下载PDF
导出
摘要 知识图谱(knowledge graph,KG)中实体间缺失关系的补全,是目前KG领域研究的热点之一。随着Web2.0的快速发展,用户生成数据(user-generated data,UGD)中体现出来的实体间的关联关系是KG所描述知识的有益补充。目前基于路径的KG知识推理方法,由于存在稀疏或者错误实体关系,且连通性差,从而导致实体间关系抽取不准确。针对该问题,提出一种借助UGD中实体间关联关系来补全KG的方法。首先从UGD出发,使用互信息来计算实体节点间的关联关系,从而构建实体节点关联图(entity association graph,EAG);然后给出关联影响叠加方法来定量计算EAG中互不相邻实体间的潜在关联关系,从而得到一个关联影响值;最后对不相邻的实体节点之间的多个关联影响值再次进行叠加计算,从而判断实体间是否存在强的潜在关联关系,实现KG的补全。建立在真实数据之上的实验结果表明,所提方法对KG的补全是有效的。 The completion of missing relationships between entities in knowledge graph(KG) is the topic with great attention in the field of KG research.With the rapid development of Web2.0,the association between entities reflected by the user-generated data(UGD) is complementary to the knowledge described in KG.In the knowledge reasoning method based on KG path,there are sparse or wrong entity relations and poor connectivity,which leads to the inaccurate relationship extracted from entities.For this problem,this paper proposes a method for complementing KG by using correlation between entities in UGD.Firstly,based on the UGD,this paper uses mutual information to calculate the relationship between entity nodes and build the entity association graph(EAG),and then proposes a superposition method to quantify the potential correlation between non-adjacent entities in the EAG,so the association impact values are obtained.Finally,the multiple correlation effects between non-adjacent entity nodes are superposed to determine whether there is a strong correlation between the entities.By adding the edges between non-adjacent entity nodes with associations,KG completion can be fulfilled.The experimental results based on real data sets show the efficiency and effectiveness of the proposed KG completion.
作者 夏维 王珊蕾 尹子都 岳昆 XIA Wei;WANG Shanlei;YIN Zidu;YUE Kun(School of Information Science and Engineering,Yunnan University,Kunming 650500,China)
出处 《计算机科学与探索》 CSCD 北大核心 2018年第7期1064-1074,共11页 Journal of Frontiers of Computer Science and Technology
基金 国家自然科学基金No.61472345 云南大学青年英才培育计划No.WX173602 云南大学研究生科研创新基金项目No.YDY17017~~
关键词 知识图谱 补全 用户生成数据 互信息 关联影响 knowledge graph completion user-generated data mutual information association impact
  • 相关文献

参考文献5

二级参考文献125

  • 1徐明伟,胡春明,刘旭东,马殿富.一种基于Web Service的分级QoS的研究与实现[J].计算机研究与发展,2005,42(4):669-675. 被引量:12
  • 2杨胜文,史美林.一种支持QoS约束的Web服务发现模型[J].计算机学报,2005,28(4):589-594. 被引量:131
  • 3张锋,许云,侯艳,樊孝忠.基于互信息的中文术语抽取系统[J].计算机应用研究,2005,22(5):72-73. 被引量:36
  • 4王晓玲,黄胜,周傲英.QoS-Aware Composite Services Retrieval[J].Journal of Computer Science & Technology,2006,21(4):547-558. 被引量:6
  • 5何婷婷,张勇.基于质子串分解的中文术语自动抽取[J].计算机工程,2006,32(23):188-190. 被引量:20
  • 6Zeng L, Benatallah B, Dumas M, et al. Quality driven Web services composition [C] //Proc of the 20th Int World Wide Web Conf. New York: ACM Press, 2003: 411-421
  • 7Benetallah B, Dumas M, Sheng Q, et al. Declarative composition and peer-to-peer provisioning of dynamic services [C] //Proc of the 18th Int Conf on Data Engineering. Los Alamitos, CA: IEEE Computer Society, 2002:297-308
  • 8Zhang J, Chung J Y, Chang C K, et al. WS-net: A Petri-net based specification model for Web services [C] //Proc of the 2nd IEEE Int Conf on Web Services. Los Alamitos: IEEE Computer Society, 2004:420-427
  • 9Hu J, Guo C, Wang H, et al. Quality driven Web services selection[C] //Proc of IEEE Int Conf on e-Business Engineering. Los Alamitos: IEEE Computer Society, 2005: 681-688
  • 10Younas M, Chao K -M, Griffiths N, et al. Quality driven Web services in mobile distributed computing [C] //Proc of Workshops of the 24th Int Conf on Distributed Computing Systems. Los Alamitos, CA: IEEE Computer Society, 2004:216-221

共引文献1427

同被引文献38

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部