284 search results - page 18 / 57 » Mining Frequent Itemsets in Distributed and Dynamic Database... |
DAWAK
2006
Springer
15 years 1 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...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
103
click to vote
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
82
Voted
KAIS
2008
14 years 9 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...