Double fuzzy relaxation local information C-Means clustering: Double fuzzy relaxation local information C-Means clustering
Fuzzy c-means clustering (FCM) has gained widespread application because of its ability to capture uncertain information in data effectively. However, attributed to the prior assumption of identical distribution, traditional FCM is sensitive to noise and cluster size. Modified methods incorporating...
Gespeichert in:
Veröffentlicht in: | Applied intelligence (Dordrecht, Netherlands) Netherlands), 2025, Vol.55 (2), p.162 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Fuzzy c-means clustering (FCM) has gained widespread application because of its ability to capture uncertain information in data effectively. However, attributed to the prior assumption of identical distribution, traditional FCM is sensitive to noise and cluster size. Modified methods incorporating local spatial information can enhance the robustness to noise. However, they tend to balance cluster sizes, resulting in poor performance when dealing with imbalanced data. Modified methods learning the statistical characteristics of data are feasible to handle imbalanced data. However, they are often sensitive to noise due to the ignorance of local information. Aiming at the lack of method that can simultaneously alleviate the sensitivity to noise and cluster size, a double fuzzy relaxation local information c-means clustering algorithm (DFRLICM) is proposed in this paper. Firstly, sample relaxation is introduced to explore potential clustering results and enhance inter-class separability. Secondly, to cooperate with the relaxation, we design fuzzy weights to record the imbalance situation of data clusters, enhancing the capability of algorithm in dealing with imbalanced data. Thirdly, we introduce fuzzy factor to account for the preservation of local structures in data and improve the robustness of algorithm. Finally, we integrate the three elements into a unified model framework to achieve the combination optimization of robustness to noise and insensitivity to cluster size simultaneously. Extensive experiments are conducted and the results demonstrate that the proposed algorithm indeed achieves a balance between robustness to noise and insensitivity to cluster size. |
---|---|
ISSN: | 0924-669X 1573-7497 |
DOI: | 10.1007/s10489-024-06078-6 |