Efficient Approaches for Density-Based Spatial Clustering of Applications with Noise

Abstract

A significant challenge for the growing world of data is to analyze, classify and manipulate spatial data. The challenge starts with the clustering process, which can be defined to characterize the spatial data with their relative properties in different groups or classes. This process can be performed using many different methods like grids, density, hierarchical and others. Among all these methods, the use of density for grouping leads to a lower noise data in result, which is called Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The DBSCAN algorithm defines a data set in a group and separates the group from the other groups based on the density of the data surrounding the selection of data points. These data points and the density of the data are calculated depending on two parameters. One parameter is used as the radius of the data point to find the neighborhood data points. Another parameter is used to identify the noise in the collected data by keeping the minimum number of data points for the data density. Like other popular method k-means, DBSCAN does not require any input of the cluster number. It can sort the data set with the number of clusters according to data density. The purpose of this article is to explain the Efficient Density-based Spatial Clustering of Applications with Noise (DBSCAN) using a sample of data set, compare the results, identify the constraints, and suggest some possible solutions.