基于滑动窗口的进化数据流聚类-软件学报.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.18, No.4, April 2007, pp.905−9 18 http://www.j DOI: 10. 1360/jos1 80905 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 基于滑动窗口的进化数据流聚类 常建龙, 曹 锋, 周傲英+ (复旦大学 计算机科学与工程系,上海 200433) Clustering Evolving Data Streams over Sliding Windows CHANG Jian-Long, CAO Feng, ZHOU Ao-Ying+ (Department of Computer Science and Engineering, Fudan University, Shanghai 200433, China) + Corresponding author: Phn: +86-21 E-mail: ayzhou@, Chang JL, Cao F, Zhou AY. Clustering evolving data streams over sliding windows. Journal of Sof tware, 2007,18(4):905−918. /1000-9825/18/905.htm Abstract: To address the sliding window based clustering, two types of exponential histogram of cluster features, false positive and false negative, are introduced in this paper. With these structures, a clustering algorithm based on sliding windows is proposed. The algorithm can precisely obtain the distribution of recent records with limited memory, thus it can produce the clustering result over sliding windows. Furthermore, it can be extended to deal with the clustering problem over N -n window (an extended model of the sliding window). The evolving data streams in the experiments include KDD-CUP’99 and KDD-CUP’98 real data sets and synthetic data sets with changing Gaussian distribution. Theoretical analysis and comprehensive experimental results demonstrate that the proposed method is of high quality, little memory and fast processing rate. Key words: evolving data stream; clustering; sliding window 摘 要: 提出了纳伪(false positive)和拒真(false negative)两种聚类特征指数直方图分别来支持纳伪误差和拒真误 差窗口的聚类