An effective hashtable-based approach for incrementally mining closed frequent itemsets using sliding windows
by M. Jeya Sutha; F. Ramesh Dhanaseelan
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 8, No. 4, 2016

Abstract: Online mining of closed frequent itemsets over streaming data is one of the important problems in mining data streams. In this paper, we propose a new algorithm called 'CFI-StreamSW' (mining closed frequent itemsets over data streams using sliding window), for mining the set of closed frequent itemsets. An effective hash table based approach is followed where two tables are used; one for storing all the items in the transactions and another for closed frequent itemsets. Thus, it does not store any other intermediate nodes or even frequent nodes. Experiments show that the proposed algorithm runs faster and consume less memory than existing algorithms 'NewMoment' and 'MWFP-SW' for mining closed frequent itemsets over recent data streams.

Online publication date: Sun, 01-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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 subs@inderscience.com