Sciweavers

Share
KDD
1999
ACM

An Efficient Algorithm to Update Large Itemsets with Early Pruning

10 years 8 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in updating the existing large itemsets by detecting and removing those that will no longer remain large after the contribution of the new set of transactions. It differs from the other update algorithms by scanning the existing database at most once and the new database exactly once. Moreover, it generates and counts the minimum number of candidates in the new database. The experiments on synthetic data show that UWEP outperforms the existing algorithms in terms of the candidates generated and counted. Keywords. Maintenance of association rules, dynamic pruning, large itemsets.
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where KDD
Authors Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arkun
Comments (0)
books