Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Authors:
- 1 January 2003
- journal article
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 7 (1) , 5-22
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning2002
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Efficiently mining long patterns from databases1998
- Exploratory mining and pruning optimizations of constrained associations rules1998
- Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1997
- Mining association rules between sets of items in large databases1993