| Abstrakt: |
The fuzzy C-ordered-means clustering (FCOM) is a fuzzy clustering algorithm that enhances robustness and clustering accuracy through the ordered mechanism based on fuzzy C-means (FCM). However, despite these improvements, the FCOM algorithm’s effectiveness remains unsatisfactory due to the significant time cost incurred by its ordered operation. To address this problem, an investigation was conducted on the ordered weighted model of the FCOM algorithm leading to proposed enhancements by introducing the beta distribution weighted fuzzy C-ordered-means clustering (BDFCOM). The BDFCOM algorithm utilises the properties of the Beta distribution to weight sample features, thus not only circumventing the time cost problem of the traditional ordered mechanism but also reducing the influence of noise. Experiments were conducted on six UCI datasets to validate the effectiveness of the BDFCOM, comparing its performance against seven other clustering algorithms using six evaluation indices. The results show that compared to the average of the other seven algorithms, BDFCOM improves about 15 percent on F1-score, 11 percent on Rand Index, 13 percent on Adjusted Rand Index, 3 percent on Fowlkes-Mallows Index and 16 percent on Jaccard Index. For the other two ordered mechanism FCM algorithms, the time consumption was also reduced by 90.15 percent on average. The proposed algorithm, which designs a new way of feature weighting for ordered mechanisms, advances the field of ordered mechanisms. And, this paper provides a new method in the application field where there is a lot of noise in the dataset. [ABSTRACT FROM AUTHOR] |
