By Topic

A Frequent Itemsets Mining Algorithm Based on Matrix 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)
Fan Guidan ; Sch. of Comput. Sci. & Software Eng., Tianjin Polytech. Univ., Tianjin, China ; Yin Shaohong

According to the nature of data stream which can only scans database several times, this paper proposed a mining frequent item sets algorithm based on matrix in sliding window over data streams. The algorithm used two 0-1 matrices to store transaction and 2-itemsets, then we could get frequent item sets through some relative operation of the two matrices. Experimental results demonstrated the efficiency of the algorithm.

Published in:

Intelligent System Design and Engineering Applications (ISDEA), 2013 Third International Conference on

Date of Conference:

16-18 Jan. 2013