Generating non-redundant association rules
- 1 August 2000
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Mining the most interesting rulesPublished by Association for Computing Machinery (ACM) ,1999
- Pruning and summarizing the discovered associationsPublished 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
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- An incremental concept formation approach for learning from databasesTheoretical Computer Science, 1994
- Finding interesting rules from large sets of discovered association rulesPublished by Association for Computing Machinery (ACM) ,1994