A Practical Algorithm to Find the Best Episode Patterns

14 years 3 months ago

Download www.i.kyushu-u.ac.jp

Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimization problem to ﬁnd a best episode pattern that is common to one set but not common in the other set. The problem is known to be NP-hard. We give a practical algorithm to solve it exactly.

Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara,

Real-time Traffic

DIS 2001 | Episode Pattern | Generalized Concept | Subsequence Pattern | Theoretical Computer Science |

claim paper

Related Content

» Finding Composite Episodes

» A Practical Algorithm to Find the Best Subsequence Patterns

» Mining Closed Strict Episodes

» Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database

» Efficient mining of frequent episodes from complex sequences

» The long and the short of it summarising event sequences with serial episodes

» BestPractice Patterns and Tool Support for Configuring Secure Web Services Messaging

» Methodology capture discriminating between the best and the rest of community practice

» Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	DIS
Authors	Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Comments (0)

Sciweavers

A Practical Algorithm to Find the Best Episode Patterns

DIS 2001 | Episode Pattern | Generalized Concept | Subsequence Pattern | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers