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

一种基于网格的增量聚类算法*
引用本文:印桂生,于翔,宁慧.一种基于网格的增量聚类算法*[J].计算机应用研究,2009,26(6):2038-2040.
作者姓名:印桂生  于翔  宁慧
作者单位:哈尔滨工程大学,计算机科学与技术系,哈尔滨,150001
基金项目:国家自然科学基金资助项目(60603092)
摘    要:分析了现有基于网格的聚类算法,该算法具有高效且可以处理高维数据的特点,但传统网格聚类算法的聚类质量受网格划分的粒度影响较大。为此,提出了一种基于网格的增量聚类算法IGrid。IGrid算法具有传统网格聚类算法的高效性,且通过维度半径对网格空间进行了动态增量划分以提高聚类的质量。在真实数据集与仿真数据集上的实验结果表明,IGrid算法在聚类准确度以及效率上要高于传统的网格聚类算法。

关 键 词:增量  聚类  网格  数据挖掘

Incremental clustering algorithm based on grid
YIN Gui sheng,YU Xiang,NING Hui.Incremental clustering algorithm based on grid[J].Application Research of Computers,2009,26(6):2038-2040.
Authors:YIN Gui sheng  YU Xiang  NING Hui
Affiliation:(Dept. of Computer Science & Technology, Harbin Engineering University, Harbin 150001, China)
Abstract:This paper analyzed the existing clustering algorithms based on grid,and the clustering algorithms based on grid had the advantages of dealing with high dimensional data and high efficiency. However, traditional algorithms based on grid were influenced greatly by the granularity of grid partition.It proposed an incremental clustering algorithm based on grid, which was called IGrid.IGrid had the advantage of high efficiency of traditional clustering algorithms based on grid, and it also partitioned the grid space by dimensional radius in a dynamic and incremental manner to improve the quality of clustering.The experiments on real datasets and synthetic datasets show that IGrid has better performance than traditional clustering algorithms based on grid in both speed and accuracy.
Keywords:incremental  clustering  grid  data mining
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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