Dynamic grids clustering algorithm based on overlapping partition
基于相交划分的动态网格聚类算法

In order to solve the problems that data input reliance and the clustering result was not efficient in overlapping grids partition technique, this paper proposed a dynamic grids clustering algorithm based on overlapping partition (DGBO). In DGBO, used overlapping grids partition technique and shifting grids technique for solving above problems. With the help of a density threshold, merge overlapping dense grids to form clusters. As the experimental results show that DGBO algorithm can discover clusters in noisy datasets containing clusters of arbitrary shapes and sizes effectively and efficiently.