SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets
Negar Ohadi, Ali Kamandi, Mahmood Shabankhah, Seyed Mohsen Fatemi, Seyed Mohsen Hosseini, Alireza Mahmoudi
Abstract
Data clustering aims to discover the underlying structure of data. it has many applications in data analysis and it is one of the most widely used tools in data mining. DBSCAN is one of the most famous clustering algorithms. its advantages are to identify clusters of various shapes and define the number of clusters. Since DBSCAN is sensitive to its parameters which are ε and MinPts, it may perform poorly when the dataset is unbalanced. To solve this problem, this paper proposes a sliding window DBSCAN clustering algorithm that uses Gridding and local parameters for unbalanced data which we will refer to as SW-DBSCAN. The algorithm divides the dataset into several grids. The size and shape of each gird depends on the specimen density specification. Then, for each grid, the parameters are adjusted for local clustering and eventually merging data zones. Experimental results show that this algorithm can help to improve the performance of the DBSCAN algorithm and can deal with arbitrary data and asymmetric data.