A generalized fuzzy-possibilistic c-means clustering algorithm

The so-called fuzzy-possibilistic c-means (FPCM) algorithm was introduced as an early mixed-partition method aiming to eliminate some adverse effects present in the behavior of the fuzzy c-means (FCM) and the possibilistic c-means (PCM) algorithms. A great advantage of FPCM was the low number of its...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Acta Universitatis Sapientiae. Informatica Ročník 15; číslo 2; s. 404 - 431
Hlavní autoři: Naghi, Mirtill-Boglárka, Kovács, Levente, Szilágyi, László
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cluj-Napoca De Gruyter Brill Sp. z o.o., Paradigm Publishing Services 01.12.2023
Témata:
Algorithms
Clustering
Parameters
ISSN:1844-6086, 2066-7760
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The so-called fuzzy-possibilistic c-means (FPCM) algorithm was introduced as an early mixed-partition method aiming to eliminate some adverse effects present in the behavior of the fuzzy c-means (FCM) and the possibilistic c-means (PCM) algorithms. A great advantage of FPCM was the low number of its parameters, as it eliminated the possibilistic penalty terms used by PCM. Unfortunately, FPCM in its original formulation also has a weak point: the strength of the possibilistic term is in inverse proportion with the number of clustered data items, which makes FPCM act like FCM when clustering large sets of data. This paper proposes a modification of the FPCM algorithm by introducing an extra coefficient into the possibilistic term that allows us to control the strength of the possibilistic effect within the mixture model. The modified clustering model will be referred to as generalized FPCM, since a certain value of the extra parameter reduces it to the original FPCM, or in other words, FPCM is a special case of the proposed algorithm. The proposed method is evaluated using noise-free and noisy data as well.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1844-6086
2066-7760
DOI:10.2478/ausi-2023-0023