Robust Parameter Optimisation of Noise-Tolerant Clustering for DENCLUE Using Differential Evolution
(2024) In Mathematics 12(21).- Abstract
Clustering samples based on similarity remains a significant challenge, especially when the goal is to accurately capture the underlying data clusters of complex arbitrary shapes. Existing density-based clustering techniques are known to be best suited for capturing arbitrarily shaped clusters. However, a key limitation of these methods is the difficulty in automatically finding the optimal set of parameters adapted to dataset characteristics, which becomes even more challenging when the data contain inherent noise. In our recent work, we proposed a Differential Evolution-based DENsity CLUstEring (DE-DENCLUE) to optimise DENCLUE parameters. This study evaluates DE-DENCLUE for its robustness in finding accurate clusters in the presence... (More)
Clustering samples based on similarity remains a significant challenge, especially when the goal is to accurately capture the underlying data clusters of complex arbitrary shapes. Existing density-based clustering techniques are known to be best suited for capturing arbitrarily shaped clusters. However, a key limitation of these methods is the difficulty in automatically finding the optimal set of parameters adapted to dataset characteristics, which becomes even more challenging when the data contain inherent noise. In our recent work, we proposed a Differential Evolution-based DENsity CLUstEring (DE-DENCLUE) to optimise DENCLUE parameters. This study evaluates DE-DENCLUE for its robustness in finding accurate clusters in the presence of noise in the data. DE-DENCLUE performance is compared against three other density-based clustering algorithms—DPC based on weighted local density sequence and nearest neighbour assignment (DPCSA), Density-Based Spatial Clustering of Applications with Noise (DBSCAN), and Variable Kernel Density Estimation–based DENCLUE (VDENCLUE)—across several datasets (i.e., synthetic and real). The study has consistently shown superior results for DE-DENCLUE compared to other models for most datasets with different noise levels. Clustering quality metrics such as the Silhouette Index (SI), Davies–Bouldin Index (DBI), Adjusted Rand Index (ARI), and Adjusted Mutual Information (AMI) consistently show superior SI, ARI, and AMI values across most datasets at different noise levels. However, in some cases regarding DBI, the DPCSA performed better. In conclusion, the proposed method offers a reliable and noise-resilient clustering solution for complex datasets.
(Less)
- author
- Ajmal, Omer ; Arshad, Humaira ; Arshed, Muhammad Asad ; Ahmed, Saeed LU and Mumtaz, Shahzad
- organization
- publishing date
- 2024-11
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- DENCLUE algorithm, density-based clustering, differential evolution, noise robustness, parameter optimisation
- in
- Mathematics
- volume
- 12
- issue
- 21
- article number
- 3367
- publisher
- MDPI AG
- external identifiers
-
- scopus:85208445517
- ISSN
- 2227-7390
- DOI
- 10.3390/math12213367
- language
- English
- LU publication?
- yes
- id
- ec5c13a9-1c98-4436-915c-b56cb826adcf
- date added to LUP
- 2025-01-15 11:33:38
- date last changed
- 2025-04-04 14:09:16
@article{ec5c13a9-1c98-4436-915c-b56cb826adcf,
abstract = {{<p>Clustering samples based on similarity remains a significant challenge, especially when the goal is to accurately capture the underlying data clusters of complex arbitrary shapes. Existing density-based clustering techniques are known to be best suited for capturing arbitrarily shaped clusters. However, a key limitation of these methods is the difficulty in automatically finding the optimal set of parameters adapted to dataset characteristics, which becomes even more challenging when the data contain inherent noise. In our recent work, we proposed a Differential Evolution-based DENsity CLUstEring (DE-DENCLUE) to optimise DENCLUE parameters. This study evaluates DE-DENCLUE for its robustness in finding accurate clusters in the presence of noise in the data. DE-DENCLUE performance is compared against three other density-based clustering algorithms—DPC based on weighted local density sequence and nearest neighbour assignment (DPCSA), Density-Based Spatial Clustering of Applications with Noise (DBSCAN), and Variable Kernel Density Estimation–based DENCLUE (VDENCLUE)—across several datasets (i.e., synthetic and real). The study has consistently shown superior results for DE-DENCLUE compared to other models for most datasets with different noise levels. Clustering quality metrics such as the Silhouette Index (SI), Davies–Bouldin Index (DBI), Adjusted Rand Index (ARI), and Adjusted Mutual Information (AMI) consistently show superior SI, ARI, and AMI values across most datasets at different noise levels. However, in some cases regarding DBI, the DPCSA performed better. In conclusion, the proposed method offers a reliable and noise-resilient clustering solution for complex datasets.</p>}},
author = {{Ajmal, Omer and Arshad, Humaira and Arshed, Muhammad Asad and Ahmed, Saeed and Mumtaz, Shahzad}},
issn = {{2227-7390}},
keywords = {{DENCLUE algorithm; density-based clustering; differential evolution; noise robustness; parameter optimisation}},
language = {{eng}},
number = {{21}},
publisher = {{MDPI AG}},
series = {{Mathematics}},
title = {{Robust Parameter Optimisation of Noise-Tolerant Clustering for DENCLUE Using Differential Evolution}},
url = {{http://dx.doi.org/10.3390/math12213367}},
doi = {{10.3390/math12213367}},
volume = {{12}},
year = {{2024}},
}