Generalized multiplicative fuzzy possibilistic product partition C-means clustering
Regarding the defects of Ruspini partition-based clustering in revealing the intrinsic correlation between classes, this paper proposes a series of generalized multiplicative fuzzy possibilistic product partition clustering algorithms. First, based on the existing concept of generalized multiplicati...
Uloženo v:
| Vydáno v: | Information sciences Ročník 670; s. 120588 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.06.2024
|
| Témata: | |
| ISSN: | 0020-0255, 1872-6291 |
| 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!
|
| Shrnutí: | Regarding the defects of Ruspini partition-based clustering in revealing the intrinsic correlation between classes, this paper proposes a series of generalized multiplicative fuzzy possibilistic product partition clustering algorithms. First, based on the existing concept of generalized multiplicative intuitionistic fuzzy sets, this paper introduces a new concept of generalized multiplicative fuzzy sets and further defines the corresponding multiplicative fuzzy partition. Then, based on the concept of multiplicative fuzzy partition, a novel generalized multiplicative fuzzy possibilistic product partition C-means (GMFPCM) clustering algorithm is presented, and its local convergence is strictly proved using Zangwill’s theorem. Meanwhile, a robust Gaussian-base radial kernel based on the M-estimator is introduced into the GMFPCM algorithm to improve its robustness against noise and outliers in numerical data. Additionally, a multiplicative fuzzy possibilistic local information factor is constructed and embedded into the GMFPCM algorithm to strengthen its ability to suppress noise in images. Finally, the comparison with existing fuzzy possibilistic clustering algorithms in the literature confirms the competitiveness of the proposed algorithms. |
|---|---|
| ISSN: | 0020-0255 1872-6291 |
| DOI: | 10.1016/j.ins.2024.120588 |