An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases

Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, Sanjay Ranka

Efficient discovery of association rules in large databases is a well studied problem and several approaches have been proposed. However, it is non trivial to maintain the association rules current when the database is updated since, such updates could invalidate existing rules or introduce new rules. In this paper, we propose an incremental updating technique based on negative borders, for the maintenance of association rules when new transaction data is added to or deleted from a transaction database. An important feature of our algorithm is that it requires a full scan (exactly one) of the whole database only if the database update causes the negative border of the set of large itemsets to expand.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.