Maintenance of discovered informative rule sets: incremental deletion

We propose here an efficient data-mining algorithm to discover the informative rule set (IRS) when the transaction database is updated under deletion, i.e., when a small transaction data set is deleted from the original database. An IRS is defined as the smallest subset of an association rule set such that it has the same prediction sequence by confidence priority as the association rule set. A top-down level-wise approach for the discovery of IRS on static database has been proposed in reference 9. Based on the Fast UPdating technique (FUP2) for the updating of discovered association rules, we present here an algorithm to maintain the discovered IRS, under incremental deletion. Numerical comparison with the nonincremental informative rule set approach is shown to demonstrate that our proposed technique requires less computation time, in terms of number of database scanning, number of candidate rules generated and processing time, to maintain the discovered informative rule set.