Title: An efficient algorithm for mining string databases under constraints
Authors: Lee, Sau Dan ×
De Raedt, Luc #
Issue Date: 2005
Publisher: Springer-verlag berlin
Series Title: Knowledge discovery in inductive databases vol:3377 pages:108-129
Abstract: We study the problem of mining substring patterns from string databases. Patterns are selected using a conjunction of monotonic and anti-monotonic predicates. Based on the earlier introduced version space tree data structure, a novel algorithm for discovering substring patterns is introduced. It has the nice property of requiring only one database scan, which makes it highly scalable and applicable in distributed environments, where the data are not necessarily stored in local memory or disk. The algorithm is experimentally compared to a previously introduced algorithm in the same setting.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Non-KU Leuven Association publications
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat Published 663KbPostscriptView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science