计算机科学 ›› 2010, Vol. 37 ›› Issue (8): 194-197.
• 数据库与数据挖掘 • 上一篇 下一篇
刘青宝,王文熙,马德良
出版日期:
发布日期:
基金资助:
LIU Qing-bao,WANG Wen-xi,MA De-liang
Online:
Published:
摘要: 提出的基于相对密度的数据流模糊聚类算法结合了相对密度聚类和模糊聚类的优点,能形成任意形状、多密度分辫率的层次聚类结果。同时,利用微簇空间位置重叠关系,定义了微簇集合间的差运算,从而有效地支持了用户指定时间窗口内的数据流聚类要求。通过与C1uStream算法在聚类质量和处理时间两个方面的比较分析,发现基于相对密度的数据流模糊聚类算法具有明显的优势。
关键词: 多分辨率聚类,模糊聚类,数据流,相对密度
Abstract: This paper provided a relative density based data stream fuzzy clustering algorithm which inherits the advantages of relative density based clustering and fuzzy clustering, so it can discover arbitrary-shape and multi-resolution clusters. With the subtraction operator on the set of micro-clusters which is defined according to the spatial overlapping relations among micro-clusters, this algorithm can do clustering on any user-specified data stream window. Compared with C1uStream algorithm on the two areas of clustering quality and processing time, this algorithm demonstrates a clear advantage.
Key words: Multi-resolution clustering, Fuzzy clustering, Data stream, Relative density
刘青宝,王文熙,马德良. 基于相对密度的数据流模糊聚类算法[J]. 计算机科学, 2010, 37(8): 194-197. https://doi.org/
LIU Qing-bao,WANG Wen-xi,MA De-liang. Data Stream Fuzzy Clustering Algorithm Based on Relative Density[J]. Computer Science, 2010, 37(8): 194-197. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2010/V37/I8/194
Cited