Online Association Rule Mining

TitleOnline Association Rule Mining
Publication TypeTechnical Report
Year of Publication1998
AuthorsHidber, C.
Other Numbers1150
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.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1998/tr-98-033.pdf
Bibliographic Notes

ICSI Technical Report TR-98-033

Abbreviated Authors

C. Hidber

ICSI Publication Type

Technical Report