262 search results - page 2 / 53 » Generalized Closed Itemsets for Association Rule Mining |
DEXA
2004
Springer
13 years 10 months ago
2004
Springer
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
DAWAK
2010
Springer
13 years 5 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...
JCST
2008
13 years 4 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
KDD
2000
ACM
13 years 8 months ago
2000
ACM
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
CIKM
2009
Springer
13 years 9 months ago
2009
Springer
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...