Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 11 / Issue 8

available in:   PDF (142 kB) PS (134 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-011-08-1411

 

Online Mining Changes of Items over Continuous Append-only and Dynamic Data Streams

Hua-Fu Li (Department of Computer Science and Information Engineering, National Chiao-Tung University, Taiwan)

Suh-Yin Lee (Department of Computer Science and Information Engineering, National Chiao-Tung University, Taiwan)

Man-Kwan Shan (Department of Computer Science, National Chengchi University, Taiwan)

Abstract: 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 (Mining Frequency Changes 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.s Moreover, a MFC-append-based algorithm, called MFC-dynamic (Mining Frequency Changes 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.

Keywords: change mining, data streams, single-pass algorithm

Categories: H.2.8