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

基于上下文相关示例的答案集程序迭代学习

Iterative Learning of Answer Set Programs from Context Dependent Examples

Imperial College London(帝国理工学院)

Mark Law, Alessandra Russo, Krysia Broda

摘要:

近年来,已经提出了将归纳逻辑程序设计(ILP)扩展到应答集编程(ASP)范例的若干框架和系统。在ILP中,所有的例子都必须由一个假设和给定的背景知识来解释。在现有系统中,背景知识对于所有示例是相同的;然而,示例可以是上下文相关的。这意味着一些例子应该在某些信息的背景下解释,而另一些例子应该在不同的背景下解释。在本文中,我们抓住这个概念,并提出了一个上下文相关的扩展有序答案集框架的学习。在该扩展中,上下文可以用于进一步构造背景知识。然后,我们提出了一个新的迭代算法,ILASP 2 i,它利用这一功能,扩大现有的ILASP 2系统的学习任务与大量的例子。我们证明了这两种算法应用到各种学习任务的可扩展性的增益。我们的研究结果表明,与ILASP 2相比,新提出的ILASP 2 i系统可以快两个数量级,使用两个数量级的内存,同时保持相同的平均精度。本文件正在考虑被TPLP接受。

英文摘要:

In recent years, several frameworks and systems have been proposed that extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP) paradigm. In ILP, examples must all be explained by a hypothesis together with a given background knowledge. In existing systems, the background knowledge is the same for all examples; however, examples may be context-dependent. This means that some examples should be explained in the context of some information, whereas others should be explained in different contexts. In this paper, we capture this notion and present a context-dependent extension of the Learning from Ordered Answer Sets framework. In this extension, contexts can be used to further structure the background knowledge. We then propose a new iterative algorithm, ILASP2i, which exploits this feature to scale up the existing ILASP2 system to learning tasks with large numbers of examples. We demonstrate the gain in scalability by applying both algorithms to various learning tasks. Our results show that, compared to ILASP2, the newly proposed ILASP2i system can be two orders of magnitude faster and use two orders of magnitude less memory, whilst preserving the same average accuracy. This paper is under consideration for acceptance in TPLP.

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

↑