149 search results - page 7 / 30 » Itemset Materializing for Fast Mining of Association Rules |
PAKDD
2007
ACM
15 years 5 months ago
2007
ACM
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
110
click to vote
DAWAK
2010
Springer
15 years 2 days 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...
CLA
2007
15 years 13 days ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
DEXA
2004
Springer
15 years 4 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 ...
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...