Title :
A fast clustering method based on multi-splitting grid
Author :
Meng Fanyu ; Xu Yajing ; Gao Zhe ; Lin Zhiqing
Author_Institution :
Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
Clustering algorithms based on Grid are attractive for the task of data partition in spatial database. In the background of big data more and more research focuses on how to solve the conflict between efficiency and accuracy of clustering. Existing Grid-based clustering algorithms generally have a high time efficiency without considering the distribution of the data inside a grid. In this paper, a new clustering method based on multi-splitting grid (CBMG) is proposed. In CBMG algorithm grids are further split into cells in order to discover the data distribution in each grid. So if the data in a grid belongs to different clusters, CBMG can easily handle it. Because the number of cells in a grid is limited, CBMG can greatly improve the accuracy of clustering and only take less extra time consuming. Experiments show the better performance of CBMG.
Keywords :
Big Data; pattern clustering; visual databases; CBMG; big data; clustering algorithms; clustering method based on multisplitting grid; data partition; fast clustering method; grid-based clustering; spatial database; Algorithm design and analysis; Bismuth; Clustering algorithms; Data mining; Noise; Spatial databases; Time complexity; clustering; density-based; grid; multi-splitting;
Conference_Titel :
Network Infrastructure and Digital Content (IC-NIDC), 2014 4th IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-4736-2
DOI :
10.1109/ICNIDC.2014.7000343