1217 search results - page 82 / 244 » On compressing frequent patterns |
166
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
132
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
120
click to vote
SSD
2005
Springer
15 years 9 months ago
2005
Springer
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
136
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
150
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...