By Topic

A new sliding window based algorithm for frequent closed itemset mining 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

4 Author(s)
Nori, F. ; Comput. Sci. & Eng. Dept., Shiraz Univ., Shiraz, Iran ; Deypir, M. ; Hadi, M. ; Ziarati, K.

Data stream mining is an important problem in the context of data mining and knowledge discovery. Mining frequent closed itemsets within sliding window instead of complete set of frequent itemset is very interesting since it need a limited amount of memory and processing power. In this paper, we introduce an effective algorithm for closed frequent itemset mining which operates in sliding window model. This algorithm uses a novel data structure for storing transactions of the window and corresponding closed itemsets. Moreover, the supports of itemsets are computed efficiently. Experimental evaluations show that the algorithm is superior to a recently proposed algorithm in terms of runtime and memory usage.

Published in:

Computer and Knowledge Engineering (ICCKE), 2011 1st International eConference on

Date of Conference:

13-14 Oct. 2011