1217 search results - page 8 / 244 » On compressing frequent patterns |
128
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
160
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
107
click to vote
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
231
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
135
click to vote
ICPP
2007
IEEE
15 years 9 months ago
2007
IEEE
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...