65 search results - page 2 / 13 » Efficient Memory Bound Puzzles Using Pattern Databases |
FEGC
2009
13 years 2 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 ...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
VLDB
2006
ACM
14 years 5 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
TKDE
2008
13 years 4 months ago
2008
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...