A fuzzy C-means algorithm for optimizing data clustering

被引:70
作者
Hashemi, Seyed Emadedin [1 ]
Gholian-Jouybari, Fatemeh [1 ]
Hajiaghaei-Keshteli, Mostafa [1 ]
机构
[1] Tecnol Monterrey, Escuela Ingn & Ciencias, Puebla, Mexico
关键词
Whale optimization; FCM; Data clustering; Big Data; Fuzzy C-means clustering; INDEXES; SWARM; RAND;
D O I
10.1016/j.eswa.2023.120377
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Big data has increasingly become predominant in many research fields affecting human knowledge, including medicine and engineering. Cluster analysis, or clustering, is widely recognized as one of the most effective processes to deal with various types of data, especially big data. There has been considerable interest in Fuzzy CMeans (FCM) as a method for clustering data using a short-distance approach in data mining. However, despite its simplicity, this method is not suitable for clustering large data sets due to their complex structure. In particular, FCM is sensitive to cluster center initialization, and an improper initialization can result in slow or non-optimal convergence. In order to solve the FCM convergence problem and find more appropriate cluster centers, optimization methods are generally used. In this study, a whale optimization algorithm is applied to solve the problem. As a solution to the problem of big data clustering, random sampling, clustering on samples, and extending the clustering results to all data are proposed. The proposed algorithm is implemented on several large data sets, both artificial and real, with many features after normalization and standardization. To verify the validity and correctness of the performance of the proposed algorithm, the same data sets have been clustered with other known algorithms, and the results compared using several valid fuzzy indices. Based on the comparison results, it can be concluded that the proposed algorithm is more powerful and efficient than other algorithms and, hence, can be used to effectively cluster large data sets. Our study can benefit organizations and managers who have a large amount of data and are unable to classify or make use of them properly. Using big data takes a lot of time. The features of the proposed algorithm would be of great help to managers allowing them to make better decisions and improve the quality of their work.
引用
收藏
页数:14
相关论文
共 71 条
[1]   A robust clustering algorithm using spatial fuzzy C-means for brain MR images [J].
Alruwaili, Madallah ;
Siddiqi, Muhammad Hameed ;
Javed, Muhammad Arshad .
EGYPTIAN INFORMATICS JOURNAL, 2020, 21 (01) :51-66
[2]   Comparing Fuzzy, Probabilistic, and Possibilistic Partitions [J].
Anderson, Derek T. ;
Bezdek, James C. ;
Popescu, Mihail ;
Keller, James M. .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2010, 18 (05) :906-918
[3]   Fuzzy C-Means clustering algorithm for data with unequal cluster sizes and contaminated with noise and outliers: Review and development [J].
Askari, Salar .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
[4]  
Barata C, 2014, INT CONF ACOUST SPEE
[5]  
Berkhin P, 2006, GROUPING MULTIDIMENSIONAL DATA: RECENT ADVANCES IN CLUSTERING, P25
[6]  
Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms
[7]   Fuzzy Based Scalable Clustering Algorithms for Handling Big Data Using Apache Spark [J].
Bharill, Neha ;
Tiwari, Aruna ;
Malviya, Aayushi .
IEEE Transactions on Big Data, 2016, 2 (04) :339-352
[8]  
Bharill N., 2014, Advance Trends in Soft Computing, P219
[9]  
Blake CL, 1998, Uci repository of machine learning databases
[10]   Extending the rand, adjusted rand and jaccard indices to fuzzy partitions [J].
Brouwer, Roelof K. .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2009, 32 (03) :213-235