Mining frequent patterns with counting inference

This publication has 11 references indexed in Scilit:

• Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
  Published by Springer Nature ,2000
• Mining frequent patterns without candidate generation
  Published by Association for Computing Machinery (ACM) ,2000
• Mining the most interesting rules
  Published by Association for Computing Machinery (ACM) ,1999
• Efficient mining of association rules using closed itemset lattices
  Information Systems, 1999
• Efficiently mining long patterns from databases
  Published by Association for Computing Machinery (ACM) ,1998
• Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
  Data Mining and Knowledge Discovery, 1998
• Dynamic itemset counting and implication rules for market basket data
  Published by Association for Computing Machinery (ACM) ,1997
• Beyond market baskets
  Published by Association for Computing Machinery (ACM) ,1997
• An effective hash-based algorithm for mining association rules
  Published by Association for Computing Machinery (ACM) ,1995
• Mining association rules between sets of items in large databases
  Published by Association for Computing Machinery (ACM) ,1993