滑动窗口内基于密度网格的数据流聚类算法.docVIP

滑动窗口内基于密度网格的数据流聚类算法 　　摘 要:提出了一种基于密度网格的数据流聚类算法。通过引入“隶度”,对传统的基于网格密度的数据流聚类算法,以网格内数据点的个数作为网格密度的思想加以改进,解决了一个网格内属于两个类的数据点以及边界点的处理问题。从而既利用了基于网格算法的高效率,还较大程度地提高了聚类精度。 　　 　　关键词:聚类;数据流;网格;滑动窗口;隶度 　　 　　中图分类号: TP311 　　文献标志码:A 　　 　　Density grid-based data stream clustering algorithm over sliding window 　　 　　LI Zi-wen, XING Chang-zheng 　　( 　　School of Electronics and Information Engineering, Liaoning Technical University, Huludao Liaoning 125105, China 　　 　　) 　　Abstract: 　　This paper introduced a density grid-based data stream clustering algorithm. Through the introduction of the subject degree in this paper, improved the traditional density grid-based clustering algorithm for data streams of data points within the grid as the grid density, thereby resolving the problem of data points belonging to two classes in one grid as well as the treatment of boundary points. Thus both the use of grid-based algorithm for high efficiency is also a large degree improved in clustering accuracy. 　　 　　This paper introduced a density grid-based data stream clustering algorithm. Through the introduction of the ??subject?? degree, the traditional density grid-based clustering algorithm for data stream was improved by taking the data points within the grid as the grid density, thereby resolving the problem of data points belonging to two classes in one grid as well as the treatment of boundary points. Therefore, not only the high efficiency of the grid-based algorithm was utilized, but also the clustering accuracy was raised significantly. 　　 　　Key words: 　　clustering;data stream;grid;sliding window;subject degree 　　 　　0 引言 　　随着计算机技术、通信技术以及网络技术的飞速发展,许多领域中出现了连续到达、持续增长、动态演化的数据――数据流,常见的应用有网络监控日志、电话通信记录、银行交易信息等。从数据流中获取知识的数据挖掘研究得到了广泛的关注,数据流聚类作为知识发现的重要手段也得到了深入的研究[1]。 　　文献[2]提出了单层数据流聚类算法STREAM[2],并利用SSQ证明了在多种情况下,STREAM算法的聚类效果比BRICH算法要好。但此类算法的缺点是只能提供对当前数据流的一种描述,而不能反映数据流的变化情况。文献[3]中提出了解决数据流聚类的一个双层算法框架及其聚类算法CluStream,这种双层框架可以较好地解决数据流聚类问题中实时要求与聚类质量间的矛盾。CluStream算法离线层使用的是改进的k-means算法,对于非