A practical algorithm to find the best episode patterns (2001) [10 citations — 10 self]
by Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
In Proc. Discovery Science 2001, volume 2226 of LNAI
http://www.i.kyushu-u.ac.jp/~s-ine/./papers/ds01.ps.gz
Add To MetaCart
Abstract:
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. 1
Citations
| 192 | Discovering frequent episodes in sequences – Mannila, Toivonen, et al. - 1995 |
| 176 | Finding pattern common to a set of strings – Angluin - 1980 |
| 32 | Knowledge acquisition from amino acid sequences by machine learning system BONSAI – Shimozono, Shinohara, et al. - 1994 |
| 31 | Learning elementary formal systems – Arikawa, Shinohara, et al. - 1992 |
| 23 | Baeza-Yates. Searching subsequences – A - 1991 |
| 12 | A practical algorithm to find the best subsequence patterns – Hirao, Hoshino, et al. - 2000 |
| 9 | Discovering unordered and ordered phrase association patterns for text mining – Fujino, Arimura, et al. - 2000 |
| 4 | Episode matching – Troncek - 2001 |
