Online association rule mining
- 1 June 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 28 (2) , 145-156
- https://doi.org/10.1145/304182.304195
Abstract
We present a novel algorithm to compute large itemsets online. The user is free to change the support threshold any time during the first scan of the transaction sequence. The algorithm maintains a superset of all large itemsets and for each itemset a shrinking, deterministic interval on its support. After at most 2 scans the algorithm terminates with the precise support for each large itemset. Typically our algorithm is by an order of magnitude more memory efficient than Apriori or DIC.Keywords
This publication has 3 references indexed in Scilit:
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Online aggregationPublished by Association for Computing Machinery (ACM) ,1997
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993