Tough constraint-based frequent closed itemsets mining
- 9 March 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 416-420
- https://doi.org/10.1145/952532.952615
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Generating non-redundant association rulesPublished by Association for Computing Machinery (ACM) ,2000
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Optimization of constrained frequent set queries with 2-variable constraintsPublished by Association for Computing Machinery (ACM) ,1999
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993