Constraint-Based Mining of Sequential Patterns over Datasets with Consecutive Repetitions

onstraint-based mining of sequential patterns is an active research area motivated by many application domains. In practice, the real sequence datasets can present consecutive repetitions of symbols (e.g., DNA sequences, discretized stock market data) that can lead to a very important consumption of resources during the extraction of patterns that can turn even efficient algorithms to become unusable. We propose a constraint-based mining algorithm using an approach that enables to compact these consecutive repetitions, reducing drastically the amount of data to process and speeding-up the extraction time. The technique introduced in this paper allows to retain the advantages of existing state-of-the-art algorithms based on the notion of occurrence lists, while permitting to extend their application fields to datasets containing consecutive repetitions. We analyze the benefits obtained using synthetic datasets, and show that the approach is of practical interest on real datasets.


Editor(s):
Lavrač, Nada
Gamberger, Dragan
Todorovski, Ljupčo
Blockeel, Hendrik
Published in:
Knowledge Discovery in Databases: PKDD 2003, 303-314
Presented at:
7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003
Year:
2003
Publisher:
Berlin, Heidelberg, Springer
Laboratories:




 Record created 2017-08-30, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)