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

描述逻辑的有效概念归纳

Efficient Concept Induction for Description Logics

Wright State University(莱特州立大学)

Md Kamruzzaman Sarker, Pascal Hitzler

摘要:

概念归纳是指创建复杂描述逻辑类描述的问题(即,TBox公理)的实例(即,ABox数据)。在本文中,我们特别关注的情况下,既有一组积极的和一组消极的情况下,并寻求复杂的类表达式下,积极的,但不是消极的例子。概念归纳已经在本体工程中找到了应用,但是现有的算法在某些情况下具有基本的性能问题,主要是因为通常需要大量的外部描述逻辑推理机的调用。在本文中,我们提出了一个新的算法,这个问题大大减少了所需的推理机调用的数量。虽然这是在一个更有限的遍历的搜索空间的代价,我们表明,我们的方法提高了执行时间高达几个数量级,而输出的正确性,测量的输入实例的正确覆盖量,在许多情况下仍然相当高。因此,我们的方法应该为现有系统提供一个强有力的替代方案,特别是在其他系统非常缓慢的情况下。

英文摘要:

Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox data). In this paper we look particularly at the case where both a set of positive and a set of negative instances are given, and complex class expressions are sought under which the positive but not the negative examples fall. Concept induction has found applications in ontology engineering, but existing algorithms have fundamental performance issues in some scenarios, mainly because a high number of invokations of an external Description Logic reasoner is usually required. In this paper we present a new algorithm for this problem which drastically reduces the number of reasoner invokations needed. While this comes at the expense of a more limited traversal of the search space, we show that our approach improves execution times by up to several orders of magnitude, while output correctness, measured in the amount of correct coverage of the input instances, remains reasonably high in many cases. Our approach thus should provide a strong alternative to existing systems, in particular in settings where other systems are prohibitively slow.

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

↑