248 search results - page 21 / 50 » Mining Compressing Sequential Patterns |
SPIRE
1998
Springer
14 years 20 days ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
DKE
2007
13 years 8 months ago
2007
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...