165 search results - page 10 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
KDD
2004
ACM
14 years 8 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...
KDD
1999
ACM
13 years 12 months ago
1999
ACM
It has been claimed that the discovery of association rules is well-suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
ICDM
2002
IEEE
14 years 17 days ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...