17 search results - page 1 / 4 » A Framework for Frequent Sequence Mining under Generalized R... |
KDID
2003
14 years 7 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
ICDM
2008
IEEE
15 years 28 days ago
2008
IEEE
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
CORR
2008
Springer
14 years 6 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
EDBT
2009
ACM
14 years 10 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
AMW
2009
14 years 7 months ago
2009
In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in th...