113 search results - page 8 / 23 » Efficient Discovery of Frequent Approximate Sequential Patte... |
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
CORR
2008
Springer
13 years 7 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
FEGC
2009
13 years 5 months ago
2009
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...