An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases Online publication date: Fri, 22-Feb-2008
by Ruili Wang, Luofeng Xu, Stephen Marsland, Ramesh Rayudu
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 4, No. 3/4, 2008
Abstract: In this paper we propose an extension algorithm to CLOSET+, one of the most efficient algorithms for mining frequent closed itemsets in static transaction databases, to allow it to mine frequent closed itemsets in dynamic transaction databases. In a dynamic transaction database, transactions may be added, deleted and modified with time. Based on two variant tree structures, our algorithm retains the previous mined frequent closed itemsets and updates them by considering the changes in the transaction databases only. Hence, the frequent closed itemsets in the current transaction database can be obtained without rescanning the entire changed transaction database. The performance of the proposed algorithm is compared with CLOSET+, showing performance improvements for dynamic transaction databases compared to using mining algorithms designed for static transaction databases.
Online publication date: Fri, 22-Feb-2008
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com