G-DBSCAN: An Improved DBSCAN Clustering Method Based On Grid

Clustering is one of the most active research fields in data mining. Clustering in statistics, pattern recognition, image processing, machine learning, biology, marketing and many other fields have a wide range of applications. DBSCAN is a density-based clustering algorithm. this algorithm clusters data of high density. The traditional DBSCAN clustering algorithm in finding the core object, will use this object as the center core, extends outwards continuously. At this point, the core objects growing, unprocessed objects are retained in memory, which will occupy a lot of memory and I/O overhead, algorithm efficiency is not high. In order to ensure the high efficiency of DBSCAN clustering algorithm, and reduce its memory footprint. In this paper, the original DBSCAN algorithm was improved, and the G-DBSCAN algorithm is proposed. G-DBSCAN algorithm to reduce the number of query object as a starting point, Put the data into the grid, with the center point of the data in the grid to replace all the grid points as the algorithm input. The query object will be drastically reduced, thus improving the efficiency of the algorithm, reduces the memory footprint. The results prove that G-DBSCAN algorithm is feasible and effective.

[1]  Bin Jiang,et al.  Clustering Uncertain Data Based on Probability Distribution Similarity , 2013, IEEE Transactions on Knowledge and Data Engineering.

[2]  Ping Zhu,et al.  Hierarchical Clustering Problems and Analysis of Fuzzy Proximity Relation on Granular Space , 2013, IEEE Transactions on Fuzzy Systems.

[3]  Qinbao Song,et al.  Revealing Density-Based Clustering Structure from the Core-Connected Tree of a Network , 2013, IEEE Transactions on Knowledge and Data Engineering.

[4]  C. Apte,et al.  Data mining: an industrial research perspective , 1997 .

[5]  Chengqi Zhang,et al.  Combined Mining: Discovering Informative Knowledge in Complex Data , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  Fuling Bian,et al.  A Grid and Density Based Fast Spatial Clustering Algorithm , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[7]  Ujjwal Maulik,et al.  A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I , 2014, IEEE Transactions on Evolutionary Computation.

[8]  Ming-Syan Chen,et al.  Density Conscious Subspace Clustering for High-Dimensional Data , 2010, IEEE Transactions on Knowledge and Data Engineering.

[9]  Oliver Kramer,et al.  Acceleration of DBSCAN-Based Clustering with Reduced Neighborhood Evaluations , 2010, KI.

[10]  Qi Xia,et al.  A density-based enhancement to dominant sets clustering , 2013, IET Comput. Vis..

[11]  Z. Elouedi,et al.  DBSCAN-GM: An improved clustering method based on Gaussian Means and DBSCAN techniques , 2012, 2012 IEEE 16th International Conference on Intelligent Engineering Systems (INES).

[12]  Bing Li,et al.  Efficient Clustering Aggregation Based on Data Fragments , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Marzena Kryszkiewicz,et al.  TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality , 2010, RSCTC.

[14]  Klaus C. J. Dietmayer,et al.  Grid-based DBSCAN for clustering extended objects in radar data , 2012, 2012 IEEE Intelligent Vehicles Symposium.