a density-based clustering method with calculating the eps parameter

With regard to the non-linear nature of real-life data, their clusters' shapes are non-convex and unfortunately, some clustering methods cannot identify non-convex clusters and this is a challenge. density-based clustering methods could be a solution to this problem. among all methods of this type, the dbscan algorithm can cluster data with different shapes, sizes, and densities and also identify noise points. however, owing to the use of static input parameters-the neighbourhood radius ($eps$) and the minimum value for cluster formation ($minpts$)- this algorithm has some problems such as the difficulty in accurately determining these parameters in high-dimensional data sets and not recognizing clusters with different densities. accordingly, this paper presents a density clustering algorithm, which requires minimal input parameters and one of its main parameters is $eps$, which is automatically calculated based on the $k$-nearest neighbours of points and its value is different for each cluster. to evaluate the effectiveness of the proposed algorithm, some experiments were conducted. the obtained results showed the effectiveness and efficiency of the presented algorithm regarding the correct identification of clusters with the desired shape, size, and density. in addition, the proposed algorithm was found effective in estimating the number of clusters in most of the data sets considered in this study.