Online mining changes of items over continuous append-only and dynamic data streams

檔案

本條目沒有附加檔案。

日期

2005

類型

期刊名稱

JOURNAL OF UNIVERSAL COMPUTER SCIENCE

卷期與頁次

第 11 卷第 8 期,頁 1411–1425

ISSN

0948-695X

語言

英文

摘要

Online mining changes over data streams has been recognized to be an important task in data mining. Mining changes over data streams is both compelling and challenging. In this paper, we propose a new, single-pass algorithm, called MFC-append ((M) under bar ining (F) under bar requency (C) under bar hanges of append-only data streams), for discovering the frequent frequency-changed items, vibrated frequency changed items, and stable frequency changed items over continuous append-only data streams. A new summary data structure, called Change-Sketch, is developed to compute the frequency changes between two continuous data streams as fast as possible. Moreover, a MFC-append-based algorithm, called MFC-dynamic ((M) under bar ining (F) under bar requency (C) under bar hanges of dynamic data streams), is proposed to find the frequency changes over dynamic data streams. Theoretical analysis and experimental results show that our algorithms meet the major performance requirements, namely single-pass, bounded space requirement, and real-time computing, in mining data streams.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Li, H., Lee, S., & Shan, M. (2005). Online mining changes of items over continuous append-only and dynamic data streams. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 11(8), 1411–1425. https://ir.lib.nycu.edu.tw/handle/11536/25460

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/25460