214 search results - page 10 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
JCST
2008
13 years 7 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
CORR
2011
Springer
12 years 11 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...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
IDEAL
2004
Springer
14 years 23 days ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...