• Home
  • Search
  • A fast algorithm for finding frequent episodes in event streams
  • Cite Icon139
  • https://doi.org/10.1145/1281192.1281238Copy DOI Icon

A fast algorithm for finding frequent episodes in event streams

  • Aug 12, 2007
  • Srivatsan Laxman +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently,we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of spaceand time complexities for the task of frequent episode discovery.

Similar Papers
  • Conference Article
  • Citations3

A General Depth-First-Search based Algorithm for Frequent Episode Discovery

  • Jul 01, 2018
  • Huisheng Zhu +5
  • Conference Article
  • Citations18

Accelerator-Oriented Algorithm Transformation for Temporal Data Mining

  • Oct 01, 2009
  • D Patnaik +3
  • Conference Article
  • Citations6

Analysis of Time and Space Complexity of Array, Linked List and Linked Array(hybrid) in Linear Search Operation

  • Dec 08, 2022
  • B Lokeshwar +4
  • Research Article
  • Citations1

Sparse Circulant Binary Embedding: An Asymptotic Analysis

  • Mar 01, 2018
  • IEEE Signal Processing Letters
  • Saehoon Kim +1
  • Addendum

WITHDRAWN: Spearman rank correlation based bagging ensemble bayes optimal classification for genomic predictive pattern analytics

  • Nov 01, 2020
  • Materials Today: Proceedings
  • Marrynal S Eastaff +1
  • Conference Article
  • Citations32

Energy-Efficient Algorithms

  • Jan 14, 2016
  • Erik D Demaine +3
  • Research Article
  • Citations75

A fast algorithm for optimal buffer insertion

  • Jun 01, 2005
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Weiping Shi +1
  • Research Article
  • Citations7

A Comparative Study of Three Heuristic Functions Used to Solve the 8-Puzzle

  • Jan 10, 2016
  • British Journal of Mathematics & Computer Science
  • Anca-Elena Iordan
  • Book Chapter
  • Citations9

Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery

  • Jan 01, 2013
  • Shlomi Dolev +2
  • Research Article
  • Citations10

A faster FPTAS for knapsack problem with cardinality constraint

  • Apr 04, 2022
  • Discrete Applied Mathematics
  • Wenxin Li +2
  • Research Article

Coarse grain load balance algorithm for detecting similar regions in DNA and proteins sequences

  • May 20, 2014
  • Indian journal of science and technology
  • Manhal Elfadil Eltayeeb Elnour +2
  • Conference Article
  • Citations3

Saving Space in a Time Efficient Simulation Algorithm

  • Jul 01, 2009
  • Silvia Crafa +2
  • Conference Article
  • Citations96

Stream prediction using a generative model based on frequent episodes in event sequences

  • Aug 24, 2008
  • Srivatsan Laxman +2
  • Conference Article
  • Citations37

Efficient Episode Mining of Dynamic Event Streams

  • Dec 01, 2012
  • Debprakash Patnaik +3
  • Book Chapter
  • Citations5

SVM Based MLP Neural Network Algorithm and Application in Intrusion Detection

  • Jan 01, 2011
  • Yong Hou +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.