###
DOI:
计算机系统应用英文版:2011,20(2):152-156
本文二维码信息
码上扫一扫!
一种基于网格和最小生成树的数据流聚类算法
(1.牡丹江医学院 教育技术与信息中心,牡丹江 157011;2.潍柴动力 企信部,潍坊 261041)
A Grid and MST Based Clustering Algorithm for Data Streams
(1.Center of Educational Technology and Information, Mudanjiang Medical University, Mudanjiang 157011, China;2.Department of Enterprise Management and Information Technology, Weichai Power Co., Ltd, Weifang 261041, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 3316次   下载 88
Received:June 17, 2010    Revised:July 16, 2010
中文摘要: 针对CluStream 算法对非球状簇聚类的不足,同时基于均匀网格划分的聚类算法多数是以降低聚类精度为代价来提高聚类效率,给出了一种新的数据流聚类算法—GTSClu 算法,该算法是基于网格的最小生成树(MST)数据流聚类算法。算法分为在线处理与离线聚类两部分,并运用了网格拆分与最小生成树技术,可以有效排除噪声数据,发现任意形状的聚类,实验证明提高了聚类效率和质量。
中文关键词: 聚类  数据流  网格  最小生成树
Abstract:CluStream algorithm has poor quality of clustering for non-spherical clusters, at the same time, most grid-based clustering algorithms improve the efficiency of clustering at the cost of reducing clustering accuracy. The paper gives a new kind of clustering algorithm for data stream—GTSClu, it is the minimum spanning tree data stream clustering algorithm based on grid, which is divided into online processing and offline clustering, combining with grid resolution and minimum spanning tree techniques. GTSClu algorithm cannot only find clusters with arbitrary shape and amount, but also deal with noise data effectively, the efficiency and quality of clustering is improved.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
王海波,王宪鹏,王芳,陈志国.一种基于网格和最小生成树的数据流聚类算法.计算机系统应用,2011,20(2):152-156
WANG Hai-Bo,WANG Xian-Peng,WANG Fang,CHEN Zhi-Guo.A Grid and MST Based Clustering Algorithm for Data Streams.COMPUTER SYSTEMS APPLICATIONS,2011,20(2):152-156