Mining Inference Formulas by Goal-Directed Random Walks
Wei Zhuoyu; Zhao Jun; Liu Kang
2016-11
会议日期2016.11.1-2016.11.5
会议地点Austin, Texas, USA
页码1379-1388
英文摘要Deep inference on a large-scale knowledge base (KB) needs a mass of formulas, but it is
almost impossible to create all formulas manually. Data-driven methods have been proposed to mine formulas from KBs automatically, where random sampling and approximate calculation are common techniques to handle big data. Among a series of methods, Random Walk is believed to be suitable for knowledge graph data. However, a pure random walk without goals still has a poor efficiency of mining useful formulas, and even introduces lots of noise which may mislead inference. Although several heuristic rules have been proposed to direct random walks, they do not work well due to the diversity of formulas. To this end, we propose a novel goaldirected inference formula mining algorithm, which directs random walks by the specific inference target at each step. The algorithm is more inclined to visit benefic structures to infer the target, so it can increase efficiency of random walks and avoid noise simultaneously. The experiments on both WordNet and Freebase prove that our approach is has a high efficiency and performs best on the task.
  
语种英语
内容类型会议论文
源URL[http://ir.ia.ac.cn/handle/173211/41074]  
专题模式识别国家重点实验室_自然语言处理
通讯作者Liu Kang
推荐引用方式
GB/T 7714
Wei Zhuoyu,Zhao Jun,Liu Kang. Mining Inference Formulas by Goal-Directed Random Walks[C]. 见:. Austin, Texas, USA. 2016.11.1-2016.11.5.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace