Chapter

Rough Sets and Intelligent Systems Paradigms

Volume 4585 of the series Lecture Notes in Computer Science pp 475-484

Frequent Events and Epochs in Data Stream

  • Krzysztof CabajAffiliated withInstitute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Currently used data-mining algorithms treat data globally. Nevertheless, with such methods, potentially useful knowledge that relates to local phenomena may be undetected. In this paper, we introduce new patterns in a form of local frequent events and epochs, boundaries of which correspond to discovered changes in a data stream. A local frequent event is an event which occurs in some period of time frequently, but not necessarily in the whole data stream. Such an event will be called a frequent event in a data stream. An epoch is understood as a sufficiently large group of frequent events that occur in a similar part of the data stream. The epochs are defined in such a way that they do not overlap are separated by so called change periods. In the paper, we discuss some potential applications of the proposed knowledge. Preliminary experiments are described as well.