Skip to content
Open access

A Novel Method for Automatic Parameter Tuning in Density-Based Clustering using Local Density Variations

A. Mannan Syeda Hina Mazhar Kazmi Arif Ullah Hafiz Muhammad Umair Inamul Shakoor Mansoori Abdullah Altaf
Aug 2026 · Informatica · Vol 50 · 0 citations · 46 references

TL;DR

The proposed approach addressed the issue by automatic determination of epsilon by providing an optimal value of epsilon, which plays a very important role in quality of clusters.

Abstract

Density based clustering is clustering technique which has the ability to find the arbitrary shaped clusters. One of the most important reason for the success of density-based clustering is its ability to obtain the clusters of arbitrary shapes. DBSCAN is pioneer and one of the most studied algorithms in this category of clustering. The success of DBSCAN attracted the attention of researchers. Due to its ability of forming the arbitrary shape clusters and noise detection, DBSCAN is used as a benchmark algorithm in density-based clustering technique. DBSCAN also have few limitations, one of the major limitations it suffers is the manual input parameters. DBSCAN used two manual values as an input namely Epsilon and MinPts. Epsilon define the searching area and hence plays a very important and decisive role in cluster formation. With very small value of epsilon, one may obtain too many clusters. It will be difficult to detect the noise with small value of epsilon. When the value of epsilon is larger, the size of cluster will be larger. The large size of cluster will affect the ability of algorithm to detect noise. As the epsilon plays a very important role in quality of clusters. The proposed approach addressed this issue by automatic determination of epsilon. The proposed algorithm provides an optimal value of epsilon.

Read PDF

Similar papers

Open access Aug 2026

Density-Peak-Based Clustering in Reduced Feature Spaces

Clustering is a fundamental data mining technique that groups data points by similarity. A critical challenge for clustering algorithms is the effective selection of initial cluster centers, often done through inefficient trial-and-error. To address this, a novel Adaptive Cluster Center Initialization using Density Pea...

Afsana Akter Setu, J. Singha, Sohana Jahan · 0 citations
Conference Aug 2026

Optimal Cluster Selection in Unsupervised Machine Learning Using K-Means Clustering

In unsupervised learning, Clustering is a core method used to determine unseen arrangements and structures within datasets by grouping similar instances together. Among the many clustering algorithms, Among clustering techniques, K-Means continues to be one of the most popular owing to its ease of implementation, fast...

I. Khan, H. Daud, Rajalingam Sokkalingam et al. · 0 citations
Preprint Oct 2026

Gradient-Guided Density Peak Clustering

Density peak clustering (DPC) connects each observation to its nearest neighbor of higher density and identifies cluster centers as high-density observations with unusually large nearest neighbor uphill shifts. The resulting uphill paths from observations to cluster centers, however, can be irregular and unstable in lo...

Yikun Zhang, Yen-Chi Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.