94 search results - page 4 / 19 » Efficient Frequent Itemsets Mining by Sampling |
KDD
2004
ACM
15 years 9 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...
DKE
2008
14 years 9 months ago
2008
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
APPINF
2003
14 years 10 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....