Abstract
Finding a good pattern which discriminates one set of strings from the other set is a critical task in knowledge discovery. In this paper, we review a series of our works concerning with the string pattern discovery. It includes theoretical analyses of learnabilities of some pattern classes, as well as development of practical data structures which support efficient string processing.
Original language | English |
---|---|
Pages (from-to) | 1-13 |
Number of pages | 13 |
Journal | Lecture Notes in Computer Science |
Volume | 3244 |
DOIs | |
Publication status | Published - 2004 |
Event | 15th International Conference ALT 2004: Algorithmic Learning Theory - Padova, Italy Duration: 2004 Oct 2 → 2004 Oct 5 |