Autonomous data density based clustering method

Angelov, Plamen Parvanov and Gu, Xiaowei and Gutierrez, German and Iglesias, Jose Antonio and Sanchis, Araceli (2016) Autonomous data density based clustering method. In: The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI), 2016-07-24.

[thumbnail of WCCI2016ADDClustering]
PDF (WCCI2016ADDClustering)
WCCI2016ADDClustering_V4.pdf - Accepted Version
Available under License Creative Commons Attribution-NoDerivs.

Download (1MB)


It is well known that clustering is an unsupervised machine learning technique. However, most of the clustering methods need setting several parameters such as number of clusters, shape of clusters, or other user- or problem-specific parameters and thresholds. In this paper, we propose a new clustering approach which is fully autonomous, in the sense that it does not require parameters to be pre-defined. This approach is based on data density automatically derived from their mutual distribution in the data space. It is called ADD clustering (Autonomous Data Density based clustering). It is entirely based on the experimentally observable data and is free from restrictive prior assumptions. This new method exhibits highly accurate clustering performance. Its performance is compared on benchmarked data sets with other competitive alternative approaches. Experimental results demonstrate that ADD clustering significantly outperforms other clustering methods yet does not require restrictive user- or problem-specific parameters or assumptions. The new clustering method is a solid basis for further applications in the field of data analytics.

Item Type:
Contribution to Conference (Paper)
Journal or Publication Title:
The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI)
?? fully autonomous clusteringdata densitymutual distributiondata analytics ??
ID Code:
Deposited By:
Deposited On:
24 Mar 2016 12:12
Last Modified:
10 Jan 2024 00:03