Author:
Do Viet Duc ,Ngo Thanh Long ,Ha Trung Hai ,Chu Van Hai ,Nghiem Van Tam
Abstract
Possibilistic Fuzzy c-means (PFCM) algorithm is a powerful clustering algorithm. It is a combination of two algorithms Fuzzy c-means (FCM) and Possibilistic c-means (PCM). PFCM algorithm deals with the weaknesses of FCM in handling noise sensitivity and the weaknesses of PCM in the case of coincidence clusters. However, PFCM still has a common weakness of clustering algorithms that is easy to fall into local optimization. Cuckoo search (CS) is a novel evolutionary algorithm, which has been tested on some optimization problems and proved to be stable and high-efficiency. In this study, we propose a hybrid method encompassing PFCM and improved Cuckoo search to form the proposed PFCM-ICS. The proposed method has been evaluated on 4 data sets issued from the UCI Machine Learning Repository and compared with recent clustering algorithms such as FCM, PFCM, PFCM based on particle swarm optimization (PSO), PFCM based on CS. Experimental results show that the proposed method gives better clustering quality and higher accuracy than other algorithms.
Publisher
Academy of Military Science and Technology
Reference36 articles.
1. [1]. Jain, K., Murthy, M.N., Flynn, P.J.: “Data Clustering: A Review”. ACM Computing Surveys 31(3), 264–323 (1999)
2. [2]. Xu, R., Wunsch, D.C.: “Clustering”, 2nd edn., pp. 1–13. IEEE Press, John Wiley and Sons, Inc. (2009)
3. [3]. I. H. Witten and E. Frank, “Data Mining-Pratical Machine Learning Tools and Techniques”, 3rd ed. Morgan Kaufmann Publishers, Inc., (2011).
4. [4]. S. Mitra and T. Acharya, “Data Mining: Multimedia”, Soft Computing, and Bioinformatics. Wiley, (2003).
5. [5]. Anil K. Jain. “Data clustering: 50 years beyond K-means”. Pattern Recognition Letters; 31(8):651-666, (2010).