Frequent Closures as a Concise Representation for Binary Data Mining

This publication has 5 references indexed in Scilit:

• Efficient mining of association rules using closed itemset lattices
  Information Systems, 1999
• Modeling KDD Processes within the Inductive Database Framework
  Published by Springer Nature ,1999
• Efficiently mining long patterns from databases
  Published by Association for Computing Machinery (ACM) ,1998
• Levelwise Search and Borders of Theories in Knowledge Discovery
  Data Mining and Knowledge Discovery, 1997
• Mining association rules between sets of items in large databases
  Published by Association for Computing Machinery (ACM) ,1993