Discovering Frequent Closed Itemsets for Association Rules

This publication has 9 references indexed in Scilit:

• Efficiently mining long patterns from databases
  ACM SIGMOD Record, 1998
• Pincer-search: A new algorithm for discovering the maximum frequent set
  Published by Springer Nature ,1998
• Dynamic itemset counting and implication rules for market basket data
  ACM SIGMOD Record, 1997
• Parallel Algorithms for Discovery of Association Rules
  Published by Springer Nature ,1997
• Levelwise Search and Borders of Theories in Knowledge Discovery
  Data Mining and Knowledge Discovery, 1997
• Data mining: an overview from a database perspective
  IEEE Transactions on Knowledge and Data Engineering, 1996
• Mining association rules between sets of items in large databases
  ACM SIGMOD Record, 1993
• Concept lattices and conceptual knowledge systems
  Computers & Mathematics with Applications, 1992
• Finding all closed sets: A general approach
  Order, 1991