Improved Fuzzy FCM-LI Algorithm

2013 ◽  
Vol 765-767 ◽  
pp. 670-673
Author(s):  
Li Bo Hou
Keyword(s):  
Real Time ◽  
Clustering Algorithm ◽  
Feature Analysis ◽  
Cluster Center ◽  
High Dimensional ◽  
Fuzzy C Means ◽  
Sample Data ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering ◽  
Np Hard Problem

Fuzzy C-means (FCM) clustering algorithm is one of the widely applied algorithms in non-supervision of pattern recognition. However, FCM algorithm in the iterative process requires a lot of calculations, especially when feature vectors has high-dimensional, Use clustering algorithm to sub-heap, not only inefficient, but also may lead to "the curse of dimensionality." For the problem, This paper analyzes the fuzzy C-means clustering algorithm in high dimensional feature of the process, the problem of cluster center is an np-hard problem, In order to improve the effectiveness and Real-time of fuzzy C-means clustering algorithm in high dimensional feature analysis, Combination of landmark isometric (L-ISOMAP) algorithm, Proposed improved algorithm FCM-LI. Preliminary analysis of the samples, Use clustering results and the correlation of sample data, using landmark isometric (L-ISOMAP) algorithm to reduce the dimension, further analysis on the basis, obtained the final results. Finally, experimental results show that the effectiveness and Real-time of FCM-LI algorithm in high dimensional feature analysis.

scholarly journals Skin Lesion Extraction Using Multiscale Morphological Local Variance Reconstruction Based Watershed Transform and Fast Fuzzy C-Means Clustering

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2085
Author(s):  
Ranjita Rout ◽  
Priyadarsan Parida ◽  
Youseef Alotaibi ◽  
Saleh Alghamdi ◽  
Osamah Ibrahim Khalaf
Keyword(s):  
Skin Lesion ◽  
Clustering Algorithm ◽  
Skin Lesions ◽  
Gaussian Filter ◽  
Watershed Transform ◽  
Fuzzy C Means ◽  
Local Variance ◽  
Variance Filter ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering

Early identification of melanocytic skin lesions increases the survival rate for skin cancer patients. Automated melanocytic skin lesion extraction from dermoscopic images using the computer vision approach is a challenging task as the lesions present in the image can be of different colors, there may be a variation of contrast near the lesion boundaries, lesions may have different sizes and shapes, etc. Therefore, lesion extraction from dermoscopic images is a fundamental step for automated melanoma identification. In this article, a watershed transform based on the fast fuzzy c-means (FCM) clustering algorithm is proposed for the extraction of melanocytic skin lesion from dermoscopic images. Initially, the proposed method removes the artifacts from the dermoscopic images and enhances the texture regions. Further, it is filtered using a Gaussian filter and a local variance filter to enhance the lesion boundary regions. Later, the watershed transform based on MMLVR (multiscale morphological local variance reconstruction) is introduced to acquire the superpixels of the image with accurate boundary regions. Finally, the fast FCM clustering technique is implemented in the superpixels of the image to attain the final lesion extraction result. The proposed method is tested in the three publicly available skin lesion image datasets, i.e., ISIC 2016, ISIC 2017 and ISIC 2018. Experimental evaluation shows that the proposed method achieves a good result.

Application of artificial fish swarm optimization semi-supervised kernel fuzzy clustering algorithm in network intrusion

2020 ◽  
Vol 39 (2) ◽  
pp. 1619-1626
Author(s):  
Yongsheng Zong ◽  
Guoyan Huang
Keyword(s):  
Intrusion Detection ◽  
Detection Rate ◽  
Clustering Algorithm ◽  
Probabilistic Constraints ◽  
Cluster Center ◽  
Swarm Optimization ◽  
Fuzzy C Means ◽  
Network Intrusion ◽  
Fuzzy C Means Clustering ◽  
Artificial Fish Swarm

For the unsupervised learning based clustering algorithm, the intrusion detection rate is low, and the training sample based on supervised learning clustering algorithm is insufficient. A semi-supervised kernel fuzzy C-means clustering algorithm based on artificial fish swarm optimization (AFSA-KFCM) is proposed. Firstly, the kernel function is used to change the distance function in the traditional semi-supervised fuzzy C-means clustering algorithm to define a new objective function, thus improving the probabilistic constraints of the fuzzy C-means algorithm. Then, the artificial fish swarm algorithm with strong global optimization ability is used to improve the KFCM sensitivity to the initial cluster center and easy to fall into the local extremum, thus improving the convergence speed and improving the classification effect. The test results in the Wine and IRIS public datasets show that the AFSA-KFCM clustering algorithm is superior to the traditional algorithm in clustering accuracy and time efficiency. At the same time, the experimental results in KDDCUP99 experimental data show that the algorithm can obtain the ideal detection rate and false detection rate in intrusion detection.

A Novel Segmentation Method for Brain MRI Using a Block-Based Integrated Fuzzy C-Means Clustering Algorithm

2020 ◽  
Vol 10 (3) ◽  
pp. 579-585
Author(s):  
Hui Zhang ◽  
Hongjie Zhang
Keyword(s):  
Clustering Algorithm ◽  
Brain Diseases ◽  
Cluster Center ◽  
Large Sample Size ◽  
Large Sample ◽  
Fcm Algorithm ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Final Cluster ◽  
Block Based

Accurate segmentation of brain tissue has important guiding significance and practical application value for the diagnosis of brain diseases. Brain magnetic resonance imaging (MRI) has the characteristics of high dimensionality and large sample size. Such datasets create considerable computational complexity in image processing. To efficiently process large sample data, this article integrates the proposed block clustering strategy with the classic fuzzy C-means clustering (FCM) algorithm and proposes a block-based integrated FCM clustering algorithm (BI-FCM). The algorithm first performs block processing on each image and then clusters each subimage using the FCM algorithm. The cluster centers for all subimages are again clustered using FCM to obtain the final cluster center. Finally, the distance from each pixel to the final cluster center is obtained, and the corresponding division is performed according to the distance. The dataset used in this experiment is the Simulated Brain Database (SBD). The results show that the BI-FCM algorithm addresses the large sample processing problem well, and the theory is simple and effective.

Fuzzy C-Means Clustering Algorithm Based on Coefficient of Variation

2014 ◽  
Vol 998-999 ◽  
pp. 873-877
Author(s):  
Zhen Bo Wang ◽  
Bao Zhi Qiu
Keyword(s):  
Coefficient Of Variation ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Data ◽  
Cluster Center ◽  
Data Set ◽  
Fuzzy C Means ◽  
Initial Cluster ◽  
Fuzzy C Means Clustering ◽  
The Impact

To reduce the impact of irrelevant attributes on clustering results, and improve the importance of relevant attributes to clustering, this paper proposes fuzzy C-means clustering algorithm based on coefficient of variation (CV-FCM). In the algorithm, coefficient of variation is used to weigh attributes so as to assign different weights to each attribute in the data set, and the magnitude of weight is used to express the importance of different attributes to clusters. In addition, for the characteristic of fuzzy C-means clustering algorithm that it is susceptible to initial cluster center value, the method for the selection of initial cluster center based on maximum distance is introduced on the basis of weighted coefficient of variation. The result of the experiment based on real data sets shows that this algorithm can select cluster center effectively, with the clustering result superior to general fuzzy C-means clustering algorithms.

Implementation of a modified Fuzzy C-Means clustering algorithm for real-time applications

2005 ◽  
Vol 29 (8-9) ◽  
pp. 375-380 ◽  
Author(s):  
Jesús Lázaro ◽  
Jagoba Arias ◽  
José L. Martín ◽  
Carlos Cuadrado ◽  
Armando Astarloa
Keyword(s):  
Real Time ◽  
Clustering Algorithm ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Real Time Applications

scholarly journals Differential privacy fuzzy C-means clustering algorithm based on gaussian kernel function

PLoS ONE ◽  
2021 ◽  
Vol 16 (3) ◽  
pp. e0248737
Author(s):  
Yaling Zhang ◽  
Jin Han
Keyword(s):  
Privacy Protection ◽  
Clustering Algorithm ◽  
Differential Privacy ◽  
Gaussian Kernel ◽  
Cluster Center ◽  
User Privacy ◽  
Distance Method ◽  
Fuzzy C Means ◽  
Center Point ◽  
Fuzzy C Means Clustering

Fuzzy C-means clustering algorithm is one of the typical clustering algorithms in data mining applications. However, due to the sensitive information in the dataset, there is a risk of user privacy being leaked during the clustering process. The fuzzy C-means clustering of differential privacy protection can protect the user’s individual privacy while mining data rules, however, the decline in availability caused by data disturbances is a common problem of these algorithms. Aiming at the problem that the algorithm accuracy is reduced by randomly initializing the membership matrix of fuzzy C-means, in this paper, the maximum distance method is firstly used to determine the initial center point. Then, the gaussian value of the cluster center point is used to calculate the privacy budget allocation ratio. Additionally, Laplace noise is added to complete differential privacy protection. The experimental results demonstrate that the clustering accuracy and effectiveness of the proposed algorithm are higher than baselines under the same privacy protection intensity.

FUZZY C-MEANS CLUSTERING ALGORITHM WITH TWO LAYERS AND ITS APPLICATION TO IMAGE SEGMENTATION BASED ON TWO-DIMENSIONAL HISTOGRAM

1994 ◽  
Vol 02 (03) ◽  
pp. 343-350 ◽  
Author(s):  
WEIXIN XIE ◽  
JIANZHUANG LIU
Keyword(s):  
Image Segmentation ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Two Dimensional ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering ◽  
Hard Clustering

This paper presents a fast fuzzy c-means (FCM) clustering algorithm with two layers, which is a mergence of hard clustering and fuzzy clustering. The result of hard clustering is used to initialize the c cluster centers in fuzzy clustering, and then the number of iteration steps is reduced. The application of the proposed algorithm to image segmentation based on the two dimensional histogram is provided to show its computational efficience.

Embedding Global Optimization and Kernelization into Fuzzy C-Means Clustering for Consonant/Vowel Segmentation

2013 ◽  
Vol 419 ◽  
pp. 814-819
Author(s):  
Xian Zang ◽  
Kil To Chong
Keyword(s):  
Global Optimization ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Cluster Center ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Simulation Results

This paper proposes a novel clustering algorithm named global kernel fuzzy-c means (GK-FCM) to segment the speech into small non-overlapping blocks for consonant/vowel segmentation. This algorithm is realized by embedding global optimization and kernelization into the classical fuzzy c-means clustering algorithm. It proceeds in an incremental way attempting to optimally add new cluster center at each stage through the kernel-based fuzzy c-means. By solving all the intermediate problems, the final near-optimal solution is determined in a deterministic way. This algorithm overcomes the well-known shortcomings of fuzzy c-means and improves the clustering accuracy. Simulation results demonstrate the effectiveness of the proposed method in consonant/vowel segmentation.

Adaptive Kernel-Based Fuzzy C-Means Clustering with Spatial Constraints for Image Segmentation

2018 ◽  
Vol 33 (01) ◽  
pp. 1954003 ◽  
Author(s):  
Guang Hu ◽  
Zhenbin Du
Keyword(s):  
Image Segmentation ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Spatial Constraints ◽  
Fuzzy C Means ◽  
Central Pixel ◽  
Fuzzy C Means Clustering ◽  
Adaptive Kernel ◽  
Fcm Clustering ◽  
Image Pixels

In order to resolve the disadvantages of fuzzy C-means (FCM) clustering algorithm for image segmentation, an improved Kernel-based fuzzy C-means (KFCM) clustering algorithm is proposed. First, the reason why the kernel function is introduced is researched on the basis of the classical KFCM clustering. Then, using spatial neighborhood constraint property of image pixels, an adaptive weighted coefficient is introduced into KFCM to control the influence of the neighborhood pixels to the central pixel automatically. At last, a judging rule for partition fuzzy clustering numbers is proposed that can decide the best clustering partition numbers and provide an optimization foundation for clustering algorithm. An adaptive kernel-based fuzzy C-means clustering with spatial constraints (AKFCMS) model for image segmentation approach is proposed in order to improve the efficiency of image segmentation. Various experiment results show that the proposed approach can get the spatial information features of an image accurately and is robust to realize image segmentation.

Sign in / Sign up

Export Citation Format

Share Document