Can we push more constraints into frequent pattern mining?
- 1 August 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 350-354
- https://doi.org/10.1145/347090.347166
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- 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
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998