53 search results - page 2 / 11 » Mining probabilistic generalized frequent itemsets in uncert... |
110
click to vote
ICDM
2005
IEEE
15 years 4 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 ...
KDD
2006
ACM
15 years 11 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
CIKM
2005
Springer
15 years 4 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
KDD
2004
ACM
15 years 11 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...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...