Association rules mining using heavy itemsets

This publication has 12 references indexed in Scilit:

• A simple algorithm for finding frequent elements in streams and bags
  ACM Transactions on Database Systems, 2003
• Pincer-search: an efficient algorithm for discovering the maximum frequent set
  IEEE Transactions on Knowledge and Data Engineering, 2002
• Finding interesting associations without support pruning
  IEEE Transactions on Knowledge and Data Engineering, 2001
• Generating non-redundant association rules
  2000
• Turbo-charging vertical mining of large databases
  ACM SIGMOD Record, 2000
• Mining frequent patterns without candidate generation
  ACM SIGMOD Record, 2000
• Pruning and summarizing the discovered associations
  1999
• Dynamic itemset counting and implication rules for market basket data
  ACM SIGMOD Record, 1997
• Using a hash-based method with transaction trimming for mining association rules
  IEEE Transactions on Knowledge and Data Engineering, 1997
• Mining association rules between sets of items in large databases
  ACM SIGMOD Record, 1993