By Topic

Find Recent Frequent Items with Sliding Windows in 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 ; YanShan Univ., Qinhuangdao ; Ke Li

Frequent pattern mining is fundamental to many important data mining tasks. Many researchers had presented many mining methods in static database. Due to many special characters of data stream, those methods fail to be used in dynamic environment. We develop a novel method mining frequent items from data stream based on sliding window model. We use some compact data structures which make uses of the limited space efficiently. The proposed method is an approximate algorithm, it can eliminate the influence of old data to mined result. And the mined results are kept in a heap. This data structure is seldom used in other methods, and the mined results can be inquired by top-k.

Published in:

Intelligent Information Hiding and Multimedia Signal Processing, 2007. IIHMSP 2007. Third International Conference on  (Volume:2 )

Date of Conference:

26-28 Nov. 2007