On Closed Constrained Frequent Pattern Mining

This publication has 12 references indexed in Scilit:

• Efficient algorithms for mining closed itemsets and their lattice structure
  IEEE Transactions on Knowledge and Data Engineering, 2005
• Pushing Convertible Constraints in Frequent Itemset Mining
  Data Mining and Knowledge Discovery, 2004
• ExAMiner: optimized level-wise frequent pattern mining with monotone constraints
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
• FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
  Published by Springer Nature ,2004
• Tough constraint-based frequent closed itemsets mining
  Published by Association for Computing Machinery (ACM) ,2003
• Adaptive Constraint Pushing in Frequent Pattern Mining
  Published by Springer Nature ,2003
• Mining frequent patterns without candidate generation
  Published by Association for Computing Machinery (ACM) ,2000
• Efficiently mining long patterns from databases
  Published by Association for Computing Machinery (ACM) ,1998
• Exploratory mining and pruning optimizations of constrained associations rules
  Published by Association for Computing Machinery (ACM) ,1998
• Mining association rules between sets of items in large databases
  Published by Association for Computing Machinery (ACM) ,1993