LGen — A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- LGen — A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule MiningPublished by Springer Nature ,1999
- Mining quantitative association rules in large relational tablesACM SIGMOD Record, 1996
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993