A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences

Authors:
Takashi Katoh;Hiroki Arimura;Kouichi Hirata
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814;Department of Artificial Intelligence, Kyushu Institute of Technology, Iizuka, Japan 820-8502
Venue:
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Year:
2009

Citing 8
Cited 2

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Discovery of Frequent Episodes in Event Sequences

Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach

IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Closed Partial Orders from Strings

IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Diamond Episodes from Event Sequences

MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Efficient algorithms for mining frequent and closed patterns from semi-structured data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Mining Frequent Bipartite Episode from Event Sequences

DS '09 Proceedings of the 12th International Conference on Discovery Science
Mining frequent k-partite episodes from event sequences

JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding a window. Here, a diamond episode is of the form a ***E ***b , which means that every event of E follows an event a and is followed by an event b . Then, we design a polynomial-delay and polynomial-space algorithm PolyFreqDmd that finds all of the frequent diamond episodes without duplicates from an event sequence in O (|Σ |2 n ) time per an episode and in O (|Σ | + n ) space, where Σ and n are an alphabet and the length the event sequence, respectively. Finally, we give experimental results on artificial event sequences with varying several mining parameters to evaluate the efficiency of the algorithm.