A thresholded fuzzy c-means algorithm for semi-fuzzy clustering

1991 ◽  
Vol 24 (9) ◽  
pp. 825-833 ◽  
Author(s):  
M.S. Kamel ◽  
Shokri Z. Selim
2011 ◽  
Vol 211-212 ◽  
pp. 793-797
Author(s):  
Chin Chun Chen ◽  
Yuan Horng Lin ◽  
Jeng Ming Yih ◽  
Sue Fen Huang

Apply interpretive structural modeling to construct knowledge structure of linear algebra. New fuzzy clustering algorithms improved fuzzy c-means algorithm based on Mahalanobis distance has better performance than fuzzy c-means algorithm. Each cluster of data can easily describe features of knowledge structures individually. The results show that there are six clusters and each cluster has its own cognitive characteristics. The methodology can improve knowledge management in classroom more feasible.


2014 ◽  
Vol 685 ◽  
pp. 638-641
Author(s):  
Zhi Xin Ma ◽  
Bin Bin Wen ◽  
Da Gan Nie

Fuzzy clustering can express the ambiguity ofsample category, and better reflect the actual needs of datamining. By introducing wavelet transform and artificial immunealgorithm to fuzzy clustering, Wavelet-based Immune Fuzzy C-means Algorithm (WIFCM) is proposed for overcoming theimperfections of fuzzy clustering, such as falling easily into localoptimal solution, slower convergence speed and initialization-dependence of clustering centers. Innovations of WIFCM arethe elite extraction operator and the descent reproductive mode.Using the locality and multi-resolution of wavelet transform, theelite extraction operator explores the distribution and densityinformation of spatial data objects in multi-dimensional spaceto guide the search of cluster centers. Taking advantage ofthe relationship between the relative positions of elite centersand inferior centers, the descent reproductive mode obtains theapproximate fastest descent direction of objective function values,and assures fast convergence of algorithm. Compared to theclassic fuzzy C-means algorithm, experiments on 3 UCI data setsshow that WIFCM has obvious advantages in average numberof iterations and accuracy.


2012 ◽  
Vol 190-191 ◽  
pp. 265-268
Author(s):  
Ai Hong Tang ◽  
Lian Cai ◽  
You Mei Zhang

This article describes two kinds of Fuzzy clustering algorithm based on partition,Fuzzy C-means algorithm is on the basis of the hard C-means algorithm, and get a big improvement, making large data similarity as far as possible together. As a result of Simulation, FCM algorithm has more reasonable than HCM method on convergence, data fusion, and so on.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 696
Author(s):  
Haipeng Chen ◽  
Zeyu Xie ◽  
Yongping Huang ◽  
Di Gai

The fuzzy C-means clustering (FCM) algorithm is used widely in medical image segmentation and suitable for segmenting brain tumors. Therefore, an intuitionistic fuzzy C-means algorithm based on membership information transferring and similarity measurements (IFCM-MS) is proposed to segment brain tumor magnetic resonance images (MRI) in this paper. The original FCM lacks spatial information, which leads to a high noise sensitivity. To address this issue, the membership information transfer model is adopted to the IFCM-MS. Specifically, neighborhood information and the similarity of adjacent iterations are incorporated into the clustering process. Besides, FCM uses simple distance measurements to calculate the membership degree, which causes an unsatisfactory result. So, a similarity measurement method is designed in the IFCM-MS to improve the membership calculation, in which gray information and distance information are fused adaptively. In addition, the complex structure of the brain results in MRIs with uncertainty boundary tissues. To overcome this problem, an intuitive fuzzy attribute is embedded into the IFCM-MS. Experiments performed on real brain tumor images demonstrate that our IFCM-MS has low noise sensitivity and high segmentation accuracy.


2011 ◽  
Vol 07 (01) ◽  
pp. 155-171 ◽  
Author(s):  
H. D. CHENG ◽  
YANHUI GUO ◽  
YINGTAO ZHANG

Image segmentation is an important component in image processing, pattern recognition and computer vision. Many segmentation algorithms have been proposed. However, segmentation methods for both noisy and noise-free images have not been studied in much detail. Neutrosophic set (NS), a part of neutrosophy theory, studies the origin, nature, and scope of neutralities, as well as their interaction with different ideational spectra. However, neutrosophic set needs to be specified and clarified from a technical point of view for a given application or field to demonstrate its usefulness. In this paper, we apply neutrosophic set and define some operations. Neutrosphic set is integrated with an improved fuzzy c-means method and employed for image segmentation. A new operation, α-mean operation, is proposed to reduce the set indeterminacy. An improved fuzzy c-means (IFCM) is proposed based on neutrosophic set. The computation of membership and the convergence criterion of clustering are redefined accordingly. We have conducted experiments on a variety of images. The experimental results demonstrate that the proposed approach can segment images accurately and effectively. Especially, it can segment the clean images and the images having different gray levels and complex objects, which is the most difficult task for image segmentation.


Sign in / Sign up

Export Citation Format

Share Document