%0 Journal Article
%T Proposing a Density-Based Clustering Algorithm with Ability to Discover Multi-Density Clusters in Spatial Databases
%J Nashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iran
%I Iranian Research Institute for Electrical Engineering
%Z 16823745
%A A. Zadedehbalaei
%A A. Bagheri
%A H. Afshar
%D 1396
%\ 1396/09/07
%V 3
%N 15
%P 171-186
%! Proposing a Density-Based Clustering Algorithm with Ability to Discover Multi-Density Clusters in Spatial Databases
%K Multi-density
density-based clustering
spatial data mining
DBSCAN
%X Clustering is one of the important techniques for knowledge discovery in spatial databases. density-based clustering algorithms are one of the main clustering methods in data mining. DBSCAN which is the base of density-based clustering algorithms, besides its benefits suffers from some issues such as difficulty in determining appropriate values for input parameters and inability to detect clusters with different densities.
In this paper, we introduce a new clustering algorithm which unlike DBSCAN algorithm, can detect clusters with different densities. This algorithm also detects nested clusters and clusters sticking together. The idea of the proposed algorithm is as follows. First, we detect the different densities of the dataset by using a technique and Eps parameter is computed for each density. Then DBSCAN algorithm is adapted with the computed parameters to apply on the dataset. The experimental results which are obtained by running the suggested algorithm on standard and synthetic datasets by using well-known clustering assessment criteria are compared to the results of DBSCAN algorithm and some of its variants including VDBSCAN, VMDBSCAN, LDBSCAN, DVBSCAN and MDDBSCAN. All these algorithms have been introduced to solve the problem of multi-density data sets. The results show that the suggested algorithm has higher accuracy and lower error rate in comparison to the other algorithms.
%U http://rimag.ir/fa/Article/28270