Journal of Information Science

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Register here to gain access to SAGE's 500+ Journals Online

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via ISI Web of Science (1)
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Chang, J. H.
Right arrow Articles by Lee, W. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?
Journal of Information Science, Vol. 31, No. 2, 76-90 (2005)
DOI: 10.1177/0165551505050785

estWin: Online data stream mining of recent frequent itemsets by sliding window method

Joong Hyuk Chang

Yonsei University, 134 Shinchon-dong Seodaemun-gu Seoul, 120-749, Korea, jhchang{at}amadeus.yonsei.ac.kr

Won Suk Lee

Yonsei University, 134 Shinchon-dong Seodaemun-gu Seoul, 120-749, Korea

Knowledge embedded in a data stream is likely to be changed as time goes by. Identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. However, most mining algorithms over a data stream are not able to extract the recent change of knowledge in a data stream adaptively. This is because the obsolete information of old data elements which may be no longer useful or possibly invalid at present is regarded as being as important as that of recent data elements. This paper proposes a sliding window method that finds recently frequent itemsets over a transactional online data stream adaptively. The size of a sliding window defines the desired life-time of information in a newly generated transaction. Consequently, only recently generated transactions in the range of the window are considered to find the recently frequent itemsets of a data stream.

Key Words: recent change of data streams • sliding window • data streams • delayed-insertion • itemset pruning


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?


This article has been cited by other articles:


Home page
 Journal of Information ScienceHome page
J. H. Chang and W. S. Lee
Efficient mining method for retrieving sequential patterns over online data streams
Journal of Information Science, October 1, 2005; 31(5): 420 - 432.
[Abstract] [PDF]