By Topic

Updating of association rules dynamically

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
King-Kwok Ng ; Dept. of Syst. Eng. & Eng. Manage., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; Wai Lam

We propose a new algorithm to handle the problem of updating of association rules. Recent methods on this problem usually employ the Apriori algorithm. We develop a new algorithm, called the incremental dynamic itemset counting algorithm. It makes use of the dynamic counting technique to deal with this problem in a more efficient way. Experimental results show that our new algorithm outperforms a recent incremental association rule mining algorithm in terms of the computational time. We also investigate a variant of our algorithm and demonstrate its effectiveness

Published in:

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date of Conference: