Affiliations: School of Communication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an, China
Correspondence:
[*]
Corresponding author. Jing Li, School of Communication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an/710121, China. E-mail: lijing5384126@163.com.
Abstract: The relative entropy fuzzy c-means (REFCM) clustering algorithm improves the robustness of the fuzzy c-means (FCM) algorithm against noise. However, its increased complexity results in slower convergence. To address this issue, we have proposed a suppressed REFCM (SREFCM) algorithm, in which a constant suppression rate, α, is selected. However, in cases where external factors, such as changes in the data structure, are present, relying on a fixed α value may result in a decline in algorithm performance, which is clearly unsuitable. Therefore, the adaptive selection of parameters is a critical step. Based on the data structure itself, this paper proposes an algorithm for adaptive parameter selection utilizing partition entropy coefficient and alternating modified partition coefficient, and compares it to six parameter selection algorithms based on generalized rules: θ′ type, ρ type, β type, τ type, σ type and ξ type. Empirical findings indicate that adapting parameters can enhance the partitioning capability of the algorithm while ensuring a rapid convergence rate.
