A self-tuning possibilistic c-means clustering algorithm

Szilágyi, László and Lefkovits, Szidónia and Kucsván, Zsolt Levente (2018) A self-tuning possibilistic c-means clustering algorithm. In: Modeling Decisions for Artificial Intelligence, 15-18 Oct 2018, Palma de Mallorca.

Text paper17.pdf Restricted to Registered users only Download (435kB)

Abstract

Most c-means clustering models have serious difficulties when facing clusters of different sizes and severely outlier data. The possibilistic c-means (PCM) algorithm can handle both problems to some extent. However, its recommended initialization using a terminal partition produced by the probabilistic fuzzy c-means does not work when severe outliers are present. This paper proposes a possibilistic c-means clustering model that uses only three parameters independently of the number of clusters, which is able to more robustly handle the above mentioned obstacles. Numerical evaluation involving synthetic and standard test data sets prove the advantages of the proposed clustering model.

Actions (login required)

Edit Item