Probability-based incremental association rule discovery algorithm

Amornchewin, Ratchadaporn; Kreesuradej, Worapoj

doi:10.1109/CSA.2008.39

Probability-based incremental association rule discovery algorithm

Author(s)

Amornchewin, Ratchadaporn

Kreesuradej, Worapoj

Date Issued

November 28, 2008

Type

Conference Paper

DOI

10.1109/CSA.2008.39

Abstract

In dynamic databases, new transactions are appended as time advances. This may introduce new association rules and some existing association rules would become invalid. Thus, the maintenance of association rules for dynamic databases is an important problem. In this paper, probability-based incremental association rule discovery algorithm is proposed to deal with this problem. The proposed algorithm uses the principle of Bernoulli trials to find expected frequent itemsets. This can reduce a number of times to scan an original database. This paper also proposes a new updating and pruning algorithm that guarantee to find all frequent itemsets of an updated database efficiently. The simulation results show that the proposed algorithm has a good performance. © 2008 IEEE.

Citation

Proceedings International Symposium on Computer Science and Its Applications Csa 2008, 212-215, 2008