Knowledge Unit Relation Recognition Based on Markov Logic Networks

Wei Wang, Wei Wei, Jielin Hu, Junting Ye, Q. Zheng
{"title":"Knowledge Unit Relation Recognition Based on Markov Logic Networks","authors":"Wei Wang, Wei Wei, Jielin Hu, Junting Ye, Q. Zheng","doi":"10.4304/jnw.9.9.2417-2423","DOIUrl":null,"url":null,"abstract":"Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"68 1","pages":"2417-2423"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4304/jnw.9.9.2417-2423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed
基于马尔可夫逻辑网络的知识单元关系识别
知识单元(Knowledge unit, KU)是给定领域中最小的完整知识对象。知识单位关系识别是发现知识单位之间的隐含关系,是信息抽取中的关键问题。本文提出了一种基于马尔可夫逻辑网络的知识单元关系识别框架,该框架将概率图模型与一阶逻辑相结合,为每个一阶公式赋予权重。该框架主要由结构学习、人工增删公式、权重学习和推理组成。在对库及其关系进行语义分析的基础上,首先提取基谓词集。然后将基础谓词集输入到结构学习模块中,得到权重公式集。然后,为了克服结构学习的局限性,对权重规则集进行人工添加或删除。将新的权重公式集转化为权重学习模块,得到最后的权重公式集。最后,利用最后的权重公式集,通过推理模块对知识单元关系进行识别。在计算机领域相关的四个数据集上的实验表明了该方法的有效性。分析了结构学习的时间复杂度
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信