An Extended DBSCAN Clustering Algorithm

Finding clusters of different densities is a challenging task. DBSCAN “Density-Based Spatial Clustering of Applications with Noise” method has trouble discovering clusters of various densities since it uses a fixed radius. This article proposes an extended DBSCAN for finding clusters of different densities. The proposed method uses a dynamic radius and assigns a regional density value for each object, then counts the objects of similar density within the radius. If the neighborhood size ≥ MinPts, then the object is a core, and a cluster can grow from it, otherwise, the object is assigned noise temporarily. Two objects are similar in local density if their similarity ≥ threshold. The proposed method can discover clusters of any density from the data effectively. The method requires three parameters; MinPts, Eps (distance to the kth neighbor), and similarity threshold. The practical results show the superior ability of the suggested method to detect clusters of different densities even with no discernible separations between them.

@article{Fahim2022,
  title     = {An Extended DBSCAN Clustering Algorithm},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {3},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Ahmed Fahim},
  doi       = {10.14569/IJACSA.2022.0130331},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130331}
}