Fuzzy C-means (FCM) is an unsupervised clustering technique that is often used for the unsuper-vised segmentation of multivariate images. In traditional FCM the clustering is based on spectral information only and the geometrical relationship between neighbouring pixels is not used in the clustering procedure. In this paper, the spatially guided FCM (SG-FCM) algorithm is presented which segment...

Unsupervised fuzzy clustering algorithms are one of many approaches used in image segmentation. The Fuzzy C-means algorithm (FCM) and the Possibilistic C-means algorithm (PCA) have been widely used. There is also the generalized possibilistic algorithm (GPCA). GPCA was proposed recently and is a general form of the previous algorithms. These clustering algorithms can be trapped to the local opt...

In this paper, we examine the performance of fuzzy clustering algorithms as the major technique in pattern recognition. Both possibilistic and probabilistic approaches are explored. While the Possibilistic C-Means (PCM) has been shown to be advantageous over Fuzzy C-Means (FCM) in noisy environments, it has been reported that the PCM has an undesirable tendency to produce coincident clusters. R...

The triple-frequency linear combination method can provide combinations with different characteristics and is one of the important methods to improve performance navigation services. Due large number performances, combinatorial clustering optimization very important, efficiency manual screening low. Firstly, based on basic model, objective equations are derived. Secondly, fuzzy c-means (FCM) al...

This paper describes a hybrid approach of Fuzzy C-means clustering and Genetic Algorithm (GA) is proposed that provides better accuracy & increases the intrusion detection rate. This approach provides better accuracy of detection as compared to K-means and FCM Clustering. With this proposed approach intrusion detection rate is improved considerably.A brief overview of a hybrid approach of genet...

To deal with the problem of premature convergence of the fuzzy c-means clustering algorithm based on particle swarm optimization, which is sensitive to noise and less effective when handling the data set that dimensions greater than the number of samples, a novel fuzzy c-means clustering method based on the enhanced Particle Swarm Optimization algorithm is presented. Firstly, this approach dist...

This work proposes a load balance algorithm to parallel processing based on a variation of the classical knapsack problem. The problem considers the distribution of a set of partitions, defined by the number of clusters, over a set of processors attempting to achieve a minimal overall processing cost. The work is an optimization for the parallel fuzzy c-means (FCM) clustering analysis algorithm...

Nonlinearity in industrial processes such as chemical and biological processes is still a significant problem. Kernel principal component analysis (KPCA) has recently proven to be a powerful tool for monitoring nonlinear processes with numerous mutually correlated measured variables. One of the drawbacks of original KPCA is that computation time increases with the number of samples. In this art...

In this paper, we propose a Context-based Gustafson-Kessel (CGK) clustering that builds Information Granulation (IG) in the form of fuzzy set. The fundamental idea of this clustering is based on Conditional Fuzzy C-Means (CFCM) clustering introduced by Pedrycz. The proposed clustering develops clusters preserving homogeneity of the clustered patterns associated with the input and output space. ...

This study aims to empirically analyze teaching-learning-based optimization (TLBO) and machine learning algorithms using k-means fuzzy c-means (FCM) for their individual performance evaluation in terms of clustering classification. In the first phase, (k-means FCM) were employed independently accuracy was evaluated different computational measures. During second non-clustered data obtained from...