A k-Deviation Density Based Clustering Algorithm

الملخص EN

Due to the adoption of global parameters, DBSCAN fails to identify clusters with different and varied densities.

To solve the problem, this paper extends DBSCAN by exploiting a new density definition and proposes a novel algorithm called k-deviation density based DBSCAN (kDDBSCAN).

Various datasets containing clusters with arbitrary shapes and different or varied densities are used to demonstrate the performance and investigate the feasibility and practicality of kDDBSCAN.

The results show that kDDBSCAN performs better than DBSCAN.