Sciweavers

31 search results - page 4 / 7
» Frequent pattern discovery with memory constraint
Sort
View
FEGC
2009
86views Biometrics» more  FEGC 2009»
13 years 4 months ago
Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns
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 ...
Selim Mimaroglu, Dan A. Simovici
SSD
2001
Springer
218views Database» more  SSD 2001»
13 years 11 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
IS
2010
13 years 5 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 5 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 8 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis