DDSC : A Density Differentiated Spatial Clustering Technique

Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can find clusters with differing sizes and shapes in databases containing noise and outliers. But it cannot find clusters based on difference in densities. We extend the DBSCAN algorithm so that it can also detect clusters that differ in densities. Local densities within a cluster are reasonably homogeneous. Adjacent regions are separated into different clusters if there is significant change in densities. Thus the algorithm attempts to find density based natural clusters that may not be separated by any sparse region. Computational complexity of the algorithm is O(n log n).

• Type: Journal
• Year: 2008
• Where: JCP
• Authors: Bhogeswar Borah, Dhruba K. Bhattacharyya
• Keywords: Algorithm, Challenging Job, Densities, JCP 2008