DBC: a condensed representation of frequent patterns for efficient mining

This publication has 13 references indexed in Scilit:

• Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
  Data Mining and Knowledge Discovery, 2003
• A condensed representation to find frequent patterns
  Published by Association for Computing Machinery (ACM) ,2001
• A Tree Projection Algorithm for Generation of Frequent Item Sets
  Journal of Parallel and Distributed Computing, 2001
• Mining frequent patterns without candidate generation
  Published by Association for Computing Machinery (ACM) ,2000
• Approximation of Frequency Queries by Means of Free-Sets
  Published by Springer Nature ,2000
• Efficient mining of association rules using closed itemset lattices
  Information Systems, 1999
• Dynamic itemset counting and implication rules for market basket data
  Published by Association for Computing Machinery (ACM) ,1997
• Mining association rules in multiple relations
  Published by Springer Nature ,1997
• Levelwise Search and Borders of Theories in Knowledge Discovery
  Data Mining and Knowledge Discovery, 1997
• Supervised and Unsupervised Discretization of Continuous Features
  Published by Elsevier ,1995