Please use this identifier to cite or link to this item:
|Title||Finding Within Cluster Dense Regions Using Distance Based Technique|
One of the main categories in Data Clustering is density based clustering. Density based clustering techniques like DBSCAN are attractive because they can find arbitrary shaped clusters along with noisy outlier. The main weakness of the traditional density based algorithms like DBSCAN is clustering the different density level data sets. DBSCAN calculations done according to given parameters applied to all points in a data set, while densities of the data set clusters may be totally different. The proposed algorithm overcomes this weakness of the traditional density based algorithms. The algorithm starts with partitioning the data within a cluster to units based on a user parameter and compute the density for each unit separately. Consequently, the algorithm compares the results and merges neighboring units with closer approximate density values to become a new cluster. The experimental results of the simulation show that the proposed algorithm gives good results in finding clusters for different density cluster data set.
|Published in||International Journal of Intelligent Systems and Applications|
|Series||Volume: 14, Number: 2|
|Item link||Item Link|
|Files in this item|
|Ashour, Wesam M._53.pdf||688.8Kb|