98 search results - page 4 / 20 » Parallel Mining of Maximal Frequent Itemsets from Databases |
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
ICDM
2003
IEEE
13 years 11 months ago
2003
IEEE
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
DAWAK
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...