Frequent Events and Epochs in Data Stream

  • Krzysztof Cabaj
Conference paper

DOI: 10.1007/978-3-540-73451-2_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4585)
Cite this paper as:
Cabaj K. (2007) Frequent Events and Epochs in Data Stream. In: Kryszkiewicz M., Peters J.F., Rybinski H., Skowron A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science, vol 4585. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Krzysztof Cabaj
    • 1
  1. 1.Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 WarsawPoland

Personalised recommendations