抄録
The classificatory power of a pattern is measured by how well it separates two given sets of strings. This paper gives practical algorithms to find the fixed/variable-length-don't-care pattern (FVLDC pattern) and approximate FVLDC pattern which are most classificatory for two given string sets. We also present algorithms to discover the best window-accumulated FVLDC pattern and window-accumulated approximate FVLDC pattern. All of our new algorithms run in practical amount of time by means of suitable pruning heuristics and fast pattern matching techniques.
本文言語 | 英語 |
---|---|
ページ(範囲) | 486-493 |
ページ数 | 8 |
ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
巻 | 2843 |
DOI | |
出版ステータス | 出版済み - 1 1 2003 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)