Discovering Best Variable-Length-Don’t-Care Patterns.
Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings,
Lecture Notes in Computer Science Vol.2534, pp.86-97
(2002), [peer-reviewed]
Event Date:
November 24-26, 2002
Abstract / 概要
A variable-length-don’t-care pattern (VLDC pattern) is an element of set Π = (∑∪{⋆}), where ∑ is an alphabet and ⋆ is a wildcard matching any string in ∑. Given two sets of strings, we consider the problem of finding…