Incremental clustering algorithm based on grid
一种基于网格的增量聚类算法

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.