Finding Best Patterns Practically

@inproceedings{Shinohara2002FindingBP,
  title={Finding Best Patterns Practically},
  author={Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa and Masahiro Hirao and Hiromasa Hoshino and Shunsuke Inenaga},
  booktitle={Progress in Discovery Science},
  year={2002}
}
Finding a pattern which separates two sets is a critical task in discovery. Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. We generalize these problems to optimization problems, and give practical algorithms to solve them exactly. Our… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Episode matching

  • Z. Trońıček
  • In Proc. of 12th Annual Symposium on…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…