An efficient approach based on selective partitioning for maximal frequent itemsets mining

This publication has 24 references indexed in Scilit:

• PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining
  Knowledge and Information Systems, 2008
• Constraining and summarizing association rules in medical data
  Knowledge and Information Systems, 2005
• GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
  Data Mining and Knowledge Discovery, 2005
• Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
  Data Mining and Knowledge Discovery, 2004
• Discovering all most specific sentences
  ACM Transactions on Database Systems, 2003
• Distributed Web Log Mining Using Maximal Large Itemsets
  Knowledge and Information Systems, 2001
• Scalable algorithms for association mining
  IEEE Transactions on Knowledge and Data Engineering, 2000
• Efficiently mining long patterns from databases
  ACM SIGMOD Record, 1998
• Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
  Bioinformatics, 1998
• Mining association rules between sets of items in large databases
  ACM SIGMOD Record, 1993