Home > Research > Publications & Outputs > Autonomous data density based clustering method

Electronic data

  • WCCI2016ADDClustering

    Accepted author manuscript, 1.44 MB, PDF document

    Available under license: CC BY-ND: Creative Commons Attribution-NoDerivatives 4.0 International License

View graph of relations

Autonomous data density based clustering method

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Published

Standard

Autonomous data density based clustering method. / Angelov, Plamen Parvanov; Gu, Xiaowei; Gutierrez, German et al.
2016. 2405-2413 Paper presented at The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) , Canada.

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Harvard

Angelov, PP, Gu, X, Gutierrez, G, Iglesias, JA & Sanchis, A 2016, 'Autonomous data density based clustering method', Paper presented at The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) , Canada, 24/07/16 pp. 2405-2413.

APA

Angelov, P. P., Gu, X., Gutierrez, G., Iglesias, J. A., & Sanchis, A. (2016). Autonomous data density based clustering method. 2405-2413. Paper presented at The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) , Canada.

Vancouver

Angelov PP, Gu X, Gutierrez G, Iglesias JA, Sanchis A. Autonomous data density based clustering method. 2016. Paper presented at The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) , Canada.

Author

Angelov, Plamen Parvanov ; Gu, Xiaowei ; Gutierrez, German et al. / Autonomous data density based clustering method. Paper presented at The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) , Canada.9 p.

Bibtex

@conference{d477d1b94a8a4ab899e098ff265b920f,
title = "Autonomous data density based clustering method",
abstract = "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 fromrestrictive 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.",
keywords = " fully autonomous clustering, data density, mutual distribution, data analytics",
author = "Angelov, {Plamen Parvanov} and Xiaowei Gu and German Gutierrez and Iglesias, {Jose Antonio} and Araceli Sanchis",
year = "2016",
month = jul,
day = "24",
language = "English",
pages = "2405--2413",
note = "The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI) ; Conference date: 24-07-2016",

}

RIS

TY - CONF

T1 - Autonomous data density based clustering method

AU - Angelov, Plamen Parvanov

AU - Gu, Xiaowei

AU - Gutierrez, German

AU - Iglesias, Jose Antonio

AU - Sanchis, Araceli

PY - 2016/7/24

Y1 - 2016/7/24

N2 - 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 fromrestrictive 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.

AB - 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 fromrestrictive 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.

KW - fully autonomous clustering

KW - data density

KW - mutual distribution

KW - data analytics

M3 - Conference paper

SP - 2405

EP - 2413

T2 - The bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI)

Y2 - 24 July 2016

ER -