首页 | 本学科首页   官方微博 | 高级检索  
     

基于密度网格的数据流聚类算法
引用本文:米源,杨燕,李天瑞.基于密度网格的数据流聚类算法[J].计算机科学,2011,38(12):178-181.
作者姓名:米源  杨燕  李天瑞
作者单位:西南交通大学信息科学与技术学院 成都610031
基金项目:中央高校基本科研业务费专项资金(SWJTU11ZT08)资助
摘    要:针对基于密度网格的数据流聚类算法中存在的缺陷进行改进,提出一种基于D-Strcam算法的改进算法NDD-Stream。算法通过统计网格单元的密度与簇的数目,动态确定网格单元的密度阂值;对位于簇边界的网格单元采用不均匀划分,以提高簇边界的聚类精度。合成与真实数据集上的实验结果表明,算法能够在数据流对象上取得良好的聚类质量。

关 键 词:数据挖掘,数据流,聚类分析,密度网格,不均匀划分

Data Stream Clustering Algorithm Based on Density Grid
MI Yuan,YANG Yan,LI Tian-rui.Data Stream Clustering Algorithm Based on Density Grid[J].Computer Science,2011,38(12):178-181.
Authors:MI Yuan  YANG Yan  LI Tian-rui
Affiliation:MI Yuan YANG Yan LI Tian-rui (School of Information Science and Technology,Southwest Jiaotong University,Chengdu 610031,China)
Abstract:On the basis of improvements on defects in data stream clustering algorithm based on density grid, a data stream clustering algorithm was proposed which improved D-Stream algorithm. The algorithm set density threshold of grid cell dynamically by statistics on density of grid cell and number of clusters. To increase the precision of cluster boundary, a non-uniform division was employed on the grid boundary cell. The result of experiments on synthetic and real data set shows that the algorithm has fast processing speed and the ability to detect dynamic changes of data for data stream clustering, and improves clustering quality.
Keywords:Data mining  Data stream  Cluster analysis  Density grid  Non-uniform division
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号