Continuously matching episode rules for predicting future events over event streams

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Predicting future events has great importance in many applications. Generally, rules with predicate events and consequent events are mined out, and then current events are matched with the predicate ones to predict the occurrence of consequent events. Many previous works focus on the rule mining problem; however, little emphasis has been attached to the problem of predicate events matching. As events often arrive in a stream, how to design an efficient and effective event predictor becomes challenging. In this paper, we give a clear definition of this problem and propose our own method. We develop an event filter and incrementally maintain parts of the matching results. By running a series of experiments, we show that our method is efficient and effective in the stream environment. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Cho, C. W., Zheng, Y., & Chen, A. L. P. (2007). Continuously matching episode rules for predicting future events over event streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4505 LNCS, pp. 884–891). Springer Verlag. https://doi.org/10.1007/978-3-540-72524-4_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free