By Topic

Mining Closed Frequent Itemsets in Sliding Window over Data Streams

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
$31 $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)
Jiadong Ren ; Coll. of Inf. Sci. & Eng., Yanshan Univ., Qinhuangdao ; Cong Huo

As one of the most important problems in data streams mining, many studies have been done on mining closed frequent itemsets. However mining closed frequent itemsets in data streams has not been well addressed. In this paper, we design HCI-Mtree (Hash-based Closed Itemsets Monolayer tree) to maintain the complete set of current closed itemsets. In HCI-Mtree, the itemsets with the same frequency are linked to the same hash-based counter. To mining closed frequent itemsets in sliding window over data streams, we propose a novel approach HCFI (algorithm based on HCI-Mtree for mining Closed Frequent Itemsets). Vertical representation of transactions is utilized in our algorithm to save processing time and space consuming. Our experiments show that HCFI has good performance especially when the window size is large.

Published in:

Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on

Date of Conference:

18-20 June 2008