Preview

Description

We present a novel algorithm to compute large itemsets online. It needs at most two scans of the transaction sequence. Any time during the first scan, the user is free to change the support threshold. The algorithm maintains a superset of all large itemsets and a deterministic lower and upper bound on the support of each itemset. We continously display the resulting association rules along with an interval on the rule's support and confidence. The algorithm can compute association rules for a transaction sequence which is read from a network and is too large to be stored locally for a rescan. During the second scan we determine the precise support for each large itemset and prune all small itemsets using a new forward-pruning technique.

Details

Files

Actions

Statistics

from
to
Export
Download Full History