1217 search results - page 125 / 244 » On compressing frequent patterns |
152
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
156
click to vote
DPD
2010
15 years 1 months ago
2010
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
174
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
146
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
138
click to vote
ISLPED
2009
ACM
15 years 10 months ago
2009
ACM
Power gating is usually driven by a predictive control, and frequent mispredictions can counter-productively lead to a large increase in energy consumption. This energy vulnerabil...