15 search results - page 1 / 3 » Deducing Bounds on the Support of Itemsets |
CINQ
2004
Springer
13 years 12 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
SAC
2004
ACM
14 years 5 hour ago
2004
ACM
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
CINQ
2004
Springer
13 years 12 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
KDID
2004
13 years 8 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
IDA
2007
Springer
13 years 6 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...