Xianghui Hu¹, Yiming Tang^2,3, Witold Pedrycz^3,4, Jiuchuan Jiang^5,*, Yichuan Jiang^1,*

CMC-Computers, Materials & Continua, Vol.80, No.3, pp. 4917-4945, 2024, DOI:10.32604/cmc.2024.054775 - 12 September 2024

Abstract Traditional Fuzzy C-Means (FCM) and Possibilistic C-Means (PCM) clustering algorithms are data-driven, and their objective function minimization process is based on the available numeric data. Recently, knowledge hints have been introduced to form knowledge-driven clustering algorithms, which reveal a data structure that considers not only the relationships between data but also the compatibility with knowledge hints. However, these algorithms cannot produce the optimal number of clusters by the clustering algorithm itself; they require the assistance of evaluation indices. Moreover, knowledge hints are usually used as part of the data structure (directly replacing some clustering centers),… More >

Ayat Alrosan¹, Waleed Alomoush², Mohammed Alswaitti^3,*, Khalid Alissa⁴, Shahnorbanun Sahran⁵, Sharif Naser Makhadmeh⁶, Kamal Alieyan⁷

CMC-Computers, Materials & Continua, Vol.68, No.2, pp. 1575-1593, 2021, DOI:10.32604/cmc.2021.015925 - 13 April 2021

Abstract Fuzzy C-means (FCM) is a clustering method that falls under unsupervised machine learning. The main issues plaguing this clustering algorithm are the number of the unknown clusters within a particular dataset and initialization sensitivity of cluster centres. Artificial Bee Colony (ABC) is a type of swarm algorithm that strives to improve the members’ solution quality as an iterative process with the utilization of particular kinds of randomness. However, ABC has some weaknesses, such as balancing exploration and exploitation. To improve the exploration process within the ABC algorithm, the mean artificial bee colony (MeanABC) by its… More >

Ruikang Xing^1,*, Chenghai Li¹

CMC-Computers, Materials & Continua, Vol.60, No.2, pp. 767-780, 2019, DOI:10.32604/cmc.2019.04500

Abstract In clustering analysis, the key to deciding clustering quality is to determine the optimal number of clusters. At present, most clustering algorithms need to give the number of clusters in advance for clustering analysis of the samples. How to gain the correct optimal number of clusters has been an important topic of clustering validation study. By studying and analyzing the FCM algorithm in this study, an accurate and efficient algorithm used to confirm the optimal number of clusters is proposed for the defects of traditional FCM algorithm. For time and clustering accuracy problems of FCM More >