Computer Science ›› 2017, Vol. 44 ›› Issue (9): 45-48, 66.doi: 10.11896/j.issn.1002-137X.2017.09.008

Previous Articles     Next Articles

Determining Clustering Number of FCM Algorithm Based on DTRS

SHI Wen-feng and SHANG Lin   

  • Online:2018-11-13 Published:2018-11-13

Abstract: Fuzzy C-Means(FCM),as the most popular algorithm of the soft clustering,has been extensively used to make compact and well separated clusters.However,its sensitivity to initial cluster number makes choosing a better C value become very important.So it is an important step to determine the number of FCM clustering when we use FCM to do cluster analysis.In this paper,the extended decision-theoretic rough sets(DTRS) model is applied for the purpose of clustering validity analysis which could overcome the defect of the FCM algorithm.We proposed the method for determining clustering number of FCM algorithm based on DTRS,and we verified the effect of the clustering by image segmentation.Good segmentation results can be obtained when we compare the cost of different number of clusters.We compared our results with the ant colony fuzzy c-means hybrid algorithm (AFHA),which was proposed by Z.Yu et al in 2015,and the improved AFHA (IAFHA).The experimental results show that our clustering result is better in Bezdek partition coefficient with a higher value than AFHA and IAFHA algorithms,and in the Xie-Beni index as well.

Key words: Fuzzy C-Means,Decision-theoretic rough sets,Image segmentation

[1] DUNN J C.A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters[J].Journal of Cybernetics,1974,3(3):32-57.
[2] BEZDEK J C.Pattern recognition with fuzzy objective function algorithms[M].Kluwer Academic Publishers,1981.
[3] PAWLAK Z.Rough sets[J].International Journal of Computer &Information Sciences,1982,11(5):341-356.
[4] YAO Y,WONG S K M.A decision theoretic framework for approximating concepts[J].International Journal of Man-machine Studies,1992,37(6):793-809.
[5] ZHAO W Q,ZHU Y L,GAO W.Information filtering modelbased on decision-theoretic rough set theory[J].Computer Engineering and Applications,2007,43(7):185-187.(in Chinese) 赵文清,朱永利,高伟.一个基于决策粗糙集理论的信息过滤模型[J].计算机工程与应用,2007,43(7):185-187.
[6] JIA X,LIAO W,TANG Z,et al.Minimum cost attribute reduction in decision-theoretic rough set models[J].Information Sciences an International Journal,2013,9(1):151-167.
[7] LIU D,YAO Y,LI T.Three-way investment decisions with decision-theoretic rough sets[J].International Journal of Computational Intelligence Systems,2011,4(1):66-74.
[8] JIA X,ZHENG K,LI W,et al.Three-way decisions solution to filter spam email:an empirical study[M]∥Rough Sets and Current Trends in Computing.Springer Berlin Heidelberg,2012:287-296.
[9] LINGRAS P,CHEN M,MIAO D.Rough cluster quality index based on decision theory[J].IEEE Transactions on Knowledge and Data Engineering,2009,21(7):1014-1026.
[10] YU H,LIU Z,WANG G.Automatically determining the number of clusters using decision-theoretic rough set[C]∥ International Conference on Rough Sets and Knowledge Technology.Banff,Canada,2011:504-513.
[11] MARTIN D,FOWLKES C,TAL D,et al.A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics[C]∥Eighth IEEE International Conference on Computer Vision,2001(ICCV 2001).IEEE,2001:416-423.
[12] YU Z,AU O C,ZOU R,et al.An adaptive unsupervised approach toward pixel clustering and color image segmentation[J].Pattern Recognition,2010,43(5):1889-1906.
[13] BEZDEK J C.Cluster validity with fuzzy sets[J].Journal of Cybernetics,1974,3(3):58-73.
[14] BEZDEK J C.Mathematical models for systematics and taxonomy[C]∥Proceedings of Eighth International Conference on Numerical Taxonomy.1975:143-166.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .