| estWin: adaptively monitoring the recent change of frequent itemsets over online data streams |
| Full text |
Pdf
(323 KB)
|
| Source
|
Conference on Information and Knowledge Management
archive
Proceedings of the twelfth international conference on Information and knowledge management
table of contents
New Orleans, LA, USA
SESSION: Poster papers - short papers
table of contents
Pages: 536 - 539
Year of Publication: 2003
ISBN:1-58113-723-0
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 0
|
|
|
ABSTRACT
Knowledge embedded in a data stream is likely to be changed as time goes by. Consequently, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. However, most of mining algorithms or frequency approximation algorithms for a data stream do not able to extract the recent change of information in a data stream adaptively. This paper proposes a sliding window-based method that finds recently frequent itemsets over an online data stream adaptively. The size of a window defines a desired life-time of the information in a newly generated transaction. Consequently, only recently generated transactions in the range of the window are considered to find the frequent itemsets of a data stream.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. of the 28th Int'l Conference on Very Large Databases, Hong Kong, China, Aug. 2002.
|
 |
2
|
|
| |
3
|
Mayur Datar , Aristides Gionis , Piotr Indyk , Rajeev Motwani, Maintaining stream statistics over sliding windows: (extended abstract), Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.635-644, January 06-08, 2002, San Francisco, California
|
| |
4
|
|
 |
5
|
|
|