By Topic

A fast algorithm for mining frequent closed itemsets over stream sliding window

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
$33 $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

5 Author(s)
Show-Jane Yen ; Dept. of Comput. Sci. & Inf. Eng., Ming Chuan Univ., Taipei, Taiwan ; Cheng-Wei Wu ; Yue-Shi Lee ; Tseng, V.S.
more authors

Mining frequent patterns refers to the discovery of the sets of items that frequently appear in a transaction database. Many approaches have been proposed for mining frequent itemsets from a large database, but a large number of frequent itemsets may be discovered. In order to present users fewer but more important patterns, researchers are interested in discovering frequent closed itemsets which is a well-known complete and condensed representation of frequent itemsets. In this paper, we propose an efficient algorithm for discovering frequent closed itemsets over a data stream. The previous approaches need to do a large number of searching operations and computations to maintain the closed itemsets when a transaction is added or deleted. Our approach only performs few intersection operations on the transaction and the closed itemsets related to the transaction without doing any searching operation on the previous closed itemsets. The experimental results show that our approach significantly outperforms the previous approaches.

Published in:

Fuzzy Systems (FUZZ), 2011 IEEE International Conference on

Date of Conference:

27-30 June 2011