arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.00100cs.LGcs.AI
收藏

事件定义的在线学习

Online Learning of Event Definitions

National Kapodistrian University of Athens(雅典国立卡波季斯特里安大学);University of Piraeus(比雷埃夫斯大学);National Center for Scientific Research “Demokritos”(德谟克利特国家科学研究中心)

Nikos Katzouris, Alexander Artikis, Georgios Paliouras

摘要:

用于符号事件识别的系统使用一阶规则形式的一组事件定义来及时推断事件的发生。事件演算是一种时态逻辑,已被用作事件识别应用程序的基础,通过归纳逻辑程序设计(ILP)提供与机器学习的直接连接。我们提出了一个用于事件演算理论在线学习的ILP系统。为了允许单遍学习策略,我们使用Hoeffding界来评估输入流的子集上的子句。在学习过程中,我们采用了事件演算公理的解耦方案,允许孤立地学习每个子句。此外,我们使用溯因-归纳逻辑程序设计技术来处理未观察到的目标谓词。我们评估我们的方法上的活动识别应用程序,并比较它的一些批处理学习技术。我们得到的结果相当的预测精度与显着的加速训练时间。我们还优于手工制作的规则,并与只能在无噪声数据集上操作的健全增量学习器的性能相匹配。本文件正在考虑被TPLP接受。

英文摘要:

Systems for symbolic event recognition infer occurrences of events in time using a set of event definitions in the form of first-order rules. The Event Calculus is a temporal logic that has been used as a basis in event recognition applications, providing among others, direct connections to machine learning, via Inductive Logic Programming (ILP). We present an ILP system for online learning of Event Calculus theories. To allow for a single-pass learning strategy, we use the Hoeffding bound for evaluating clauses on a subset of the input stream. We employ a decoupling scheme of the Event Calculus axioms during the learning process, that allows to learn each clause in isolation. Moreover, we use abductive-inductive logic programming techniques to handle unobserved target predicates. We evaluate our approach on an activity recognition application and compare it to a number of batch learning techniques. We obtain results of comparable predicative accuracy with significant speed-ups in training time. We also outperform hand-crafted rules and match the performance of a sound incremental learner that can only operate on noise-free datasets. This paper is under consideration for acceptance in TPLP.

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

↑