1217 search results - page 48 / 244 » On compressing frequent patterns |
135
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
128
Voted
CSB
2004
IEEE
15 years 7 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
116
Voted
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
173
Voted
MLDM
2007
Springer
15 years 9 months ago
2007
Springer
Advances in wireless and mobile technology flood us with amounts of moving object data that preclude all means of manual data processing. The volume of data gathered from position...
130
Voted
FIMI
2003
15 years 5 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...