arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.3301cs.AI
收藏

大型知识库中的有效推理和学习:使用局部可接地一阶概率逻辑的提取信息推理

Efficient Inference and Learning in a Large Knowledge Base: Reasoning with Extracted Information using a Locally Groundable First-Order Probabilistic Logic

Carnegie Mellon University(卡内基梅隆大学);Google Inc.(谷歌公司)

William Yang Wang, Kathryn Mazaitis, Ni Lao, Tom Mitchell, William W. Cohen

摘要:

概率逻辑的一个重要挑战是推理非常大的知识库(KB)的不完善的信息,如现代网络规模的信息抽取系统产生的。许多概率逻辑共有的一个可扩展性问题是,回答查询涉及查询的“基础”,即,将其映射到命题表示-并且“基础”的大小随着数据库的大小而增长。为了解决这个瓶颈,我们提出了一个一阶概率语言称为ProPPR,其中近似的“本地接地”可以在时间上独立于数据库的大小。从技术上讲,ProPPR是随机逻辑程序(SLP)的扩展,偏向于短推导;它也与早期的关系学习算法密切相关,称为路径排名算法(PRA)。我们表明,这个逻辑的证明构造的问题是有关的个性化PageRank(PPR)的证明空间的线性化版本上的计算,并使用这种连接,我们开发了一个可证明的正确的近似接地方案,基于PageRank-Nibble算法。在此基础上,我们开发了一个快速,易于并行化的重量学习算法ProPPR。在实验中,我们表明,学习ProPPR是数量级的速度比学习马尔可夫逻辑网络;允许相互递归(联合学习)在KB推理导致性能的提高;和ProPPR可以学习权重的相互递归程序与数百个条款,定义分数的相互关联的谓词,超过KB包含一百万个实体。

英文摘要:

One important challenge for probabilistic logics is reasoning with very large knowledge bases (KBs) of imperfect information, such as those produced by modern web-scale information extraction systems. One scalability problem shared by many probabilistic logics is that answering queries involves "grounding" the query---i.e., mapping it to a propositional representation---and the size of a "grounding" grows with database size. To address this bottleneck, we present a first-order probabilistic language called ProPPR in which that approximate "local groundings" can be constructed in time independent of database size. Technically, ProPPR is an extension to stochastic logic programs (SLPs) that is biased towards short derivations; it is also closely related to an earlier relational learning algorithm called the path ranking algorithm (PRA). We show that the problem of constructing proofs for this logic is related to computation of personalized PageRank (PPR) on a linearized version of the proof space, and using on this connection, we develop a proveably-correct approximate grounding scheme, based on the PageRank-Nibble algorithm. Building on this, we develop a fast and easily-parallelized weight-learning algorithm for ProPPR. In experiments, we show that learning for ProPPR is orders magnitude faster than learning for Markov logic networks; that allowing mutual recursion (joint learning) in KB inference leads to improvements in performance; and that ProPPR can learn weights for a mutually recursive program with hundreds of clauses, which define scores of interrelated predicates, over a KB containing one million entities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑