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

复杂事件识别的二阶方法

A Second-Order Approach to Complex Event Recognition

Alejandro Grez, Cristian Riveros, Martin Ugarte, Stijn Vansummeren

摘要:

复杂事件识别(Complex Event Recognition,简称CER)是指在连续到达的数据流中检测模式的活动。这个领域传统上是从实践的角度来处理的,导致了具有根本不同功能的异构实现。这背后的主要原因是,为CER语言定义形式语义并不简单:它们通常将用于连接和过滤事件的一阶变量与诸如排序和Kleene闭包之类的常规运算符结合起来。此外,它们的语义通常只关注复杂事件的检测,而输出的概念大多无人关注。在本文中,我们提出了使用二阶对象来统一复杂事件识别语言的语义和输出。具体来说,我们介绍了CER语言称为二阶复杂事件逻辑(简称SO-CEL),它使用二阶变量来管理和输出事件序列。这使得主要CER操作符的定义变得简单,使我们能够开发理解其表达能力的第一步。我们首先将SO-CEL与使用一阶变量的FO-CEL版本进行比较,表明它们在限制于一元谓词时的表达能力是等同的,但令人惊讶的是,它们在一般情况下是不可比拟的。尽管如此,我们表明,如果我们限制二进制谓词集,那么SO-CEL是严格的表达比FO-CEL。然后,我们介绍了一个自然的计算模型称为一元复杂事件自动机(UCEA),提供了一个更好的理解SO-CEL。我们发现,在一元谓词,SO-CEL捕获的子类UCEA,满足所谓的 *-属性。最后,我们确定了SO-CEL缺乏捕捉UCEA的操作,并引入了一个自然的扩展语言,捕捉一元谓词下的完整类UCEA。

英文摘要:

Complex Event Recognition (CER for short) refers to the activity of detecting patterns in streams of continuously arriving data. This field has been traditionally approached from a practical point of view, resulting in heterogeneous implementations with fundamentally different capabilities. The main reason behind this is that defining formal semantics for a CER language is not trivial: they usually combine first-order variables for joining and filtering events with regular operators like sequencing and Kleene closure. Moreover, their semantics usually focus only on the detection of complex events, leaving the concept of output mostly unattended. In this paper, we propose to unify the semantics and output of complex event recognition languages by using second order objects. Specifically, we introduce a CER language called Second Order Complex Event Logic (SO-CEL for short), that uses second order variables for managing and outputting sequences of events. This makes the definition of the main CER operators simple, allowing us to develop the first steps in understanding its expressive power. We start by comparing SO-CEL with a version that uses first-order variables called FO-CEL, showing that they are equivalent in expressive power when restricted to unary predicates but, surprisingly, incomparable in general. Nevertheless, we show that if we restrict to sets of binary predicates, then SO-CEL is strictly more expressive than FO-CEL. Then, we introduce a natural computational model called Unary Complex Event Automata (UCEA) that provides a better understanding of SO-CEL. We show that, under unary predicates, SO-CEL captures the subclass of UCEA that satisfy the so-called *-property. Finally, we identify the operations that SO-CEL is lacking to capture UCEA and introduce a natural extension of the language that captures the complete class of UCEA under unary predicates.

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

↑