352 search results - page 7 / 71 » Non-derivable itemset mining |
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
DAWAK
2010
Springer
13 years 8 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ICTAI
2003
IEEE
14 years 23 days ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
DKE
2007
13 years 7 months ago
2007
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
DMIN
2007
13 years 9 months ago
2007
—We perform a statistical analysis and describe the asymptotic behavior of the frequency and size distribution of δoccurrent, minimal δ-occurrent, and maximal δ-occurrent item...