- Record: found
- Abstract: not found
- Book Chapter: not found
Computational Logic — CL 2000
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
other
December 15 2000
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references13
- Record: found
- Abstract: not found
- Conference Proceedings: not found
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami (1993)
- Record: found
- Abstract: not found
- Book: not found
Formal Concept Analysis
Bernhard Ganter, Rudolf Wille (1999)
- Record: found
- Abstract: not found
- Book Chapter: not found
Discovering Frequent Closed Itemsets for Association Rules
Nicolas Pasquier, Yves Bastide, Rafik Taouil … (1999)