Cart (Loading....) | Create Account
Close category search window
 

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.