A Practical Algorithm to Find the Best Episode Patterns

Authors:
Masahiro Hirao;Shunsuke Inenaga;Ayumi Shinohara;Masayuki Takeda;Setsuo Arikawa
Affiliations:
-;-;-;-;-
Venue:
DS '01 Proceedings of the 4th International Conference on Discovery Science
Year:
2001

Citing 5
Cited 11

Searching subsequences

Theoretical Computer Science
Polynomial-time learning of elementary formal systems

New Generation Computing
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Episode Matching

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Practical Algorithm to Find the Best Subsequence Patterns

DS '00 Proceedings of the Third International Conference on Discovery Science

Discovering Best Variable-Length-Don't-Care Patterns

DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Best Patterns Practically

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
The Minimum DAWG for All Suffixes of a String and Its Applications

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A practical algorithm to find the best subsequence patterns

Theoretical Computer Science
Episode directed acyclic subsequence graph

Nordic Journal of Computing
Algorithms for String Pattern Discovery

MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Missing pattern discovery

Journal of Discrete Algorithms
A new family of string classifiers based on local relatedness

DS'06 Proceedings of the 9th international conference on Discovery Science
Practical algorithms for pattern based linear regression

DS'05 Proceedings of the 8th international conference on Discovery Science
Composite pattern discovery for PCR application

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Discovering episodes with compact minimal windows

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 find 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.