首页 | 官方网站   微博 | 高级检索  
     

基于局部密度和动态生成网格聚类算法
引用本文:邱保志,郑智杰. 基于局部密度和动态生成网格聚类算法[J]. 计算机工程与设计, 2010, 31(2)
作者姓名:邱保志  郑智杰
作者单位:郑州大学信息工程学院,河南,郑州,450001
摘    要:为了解决网格聚类算法中的输入参数和聚类结果不精确问题,提出了基于局部密度的动态生成网格聚类算法(DGLD).该算法使用动态生成网格技术能大幅度地减少数据空间中生成的网格单元的数量,并简化邻居的搜索过程;采用局部密度思想解决数据空间相邻部分对网格密度的影响,提高了聚类精度.该算法不需要用户输入参数,能识别任意形状的聚类并有效地去除噪声点.实验结果表明该算法是有效的.

关 键 词:网格聚类  动态生成  相交网格  局部密度

Grid clustering algorithm based on local density and dynamic creating grids
QIU Bao-zhi,ZHENG Zhi-jie. Grid clustering algorithm based on local density and dynamic creating grids[J]. Computer Engineering and Design, 2010, 31(2)
Authors:QIU Bao-zhi  ZHENG Zhi-jie
Affiliation:QIU Bao-zhi,ZHENG Zhi-jie(School of Information Engineering,Zhengzhou University,Zhengzhou 450001,China)
Abstract:To resolve the problems that the grid-based clustering algorithms need the input parameters and the cluster results are imprecision,the dynamic-creating grids clustering algorithm based on local density(DGLD) is put forward.The algorithm uses dynamiccreating grids technique to reduce greatly the number of grid partitioned in data space,and simplify the neighbor search process.The algorithm adopts local-density idea to deal with the influence of the neighbor part to the current grid in data space.The algorit...
Keywords:grid-based clustering  dynamic creating  overlapping grids  local density
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号