Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets

This publication has 14 references indexed in Scilit:

• Mining the most interesting rules
  Published by Association for Computing Machinery (ACM) ,1999
• Efficient mining of association rules using closed itemset lattices
  Information Systems, 1999
• Discovering Frequent Closed Itemsets for Association Rules
  Published by Springer Nature ,1999
• Formal Concept Analysis
  Published by Springer Nature ,1999
• Constraint-based rule mining in large, dense databases
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1999
• Exploratory mining and pruning optimizations of constrained associations rules
  Published by Association for Computing Machinery (ACM) ,1998
• Beyond market baskets
  Published by Association for Computing Machinery (ACM) ,1997
• Mining association rules between sets of items in large databases
  Published by Association for Computing Machinery (ACM) ,1993
• Minimum Covers in Relational Database Model
  Journal of the ACM, 1980
• Computational problems related to the design of normal form relational schemas
  ACM Transactions on Database Systems, 1979