Fuzzy C-Means Algorithm Based on Density Canopy and Manifold Learning

Fuzzy C-Means(FCM)is an effective and widely used clustering algorithm,but there are still some problems.considering the number of clusters must be determined manually,the local optimal solutions is easily influenced by the random selection of initial cluster centers,and the performance of Euclid distance in complex high-dimensional data is poor.To solve the above problems,the improved FCM clustering algorithm based on density Canopy and Manifold learning(DM-FCM)is proposed.First,a density Canopy algorithm based on improved local density is proposed to automatically deter-mine the number of clusters and initial cluster centers,which improves the self-adaptability and stability of the algorithm.Then,considering that high-dimensional data often present a nonlinear structure,the manifold learning method is applied to construct a manifold spatial structure,which preserves the global geometric properties of complex high-dimensional data and improves the clustering effect of the algorithm on complex high-dimensional datasets.Fowlkes-Mallows Index(FMI),the weighted average of homogeneity and completeness(V-measure),Adjusted Mutual Information(AMI),and Adjusted Rand Index(ARI)are used as performance measures of clustering algorithms.The experimental results show that the manifold learning method is the superior distance measure,and the algorithm improves the clustering accuracy and performs superiorly in the clustering of low-dimensional and complex high-dimensional data.

A Fixed Suppressed Rate Selection Method for Suppressed Fuzzy C-Means Clustering Algorithm

Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.

Hybrid Clustering Using Firefly Optimization and Fuzzy C-Means Algorithm

Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.

Fuzzy c-means text clustering based on topic concept sub-space

To improve the accuracy of text clustering, fuzzy c-means clustering based on topic concept sub-space （TCS2FCM） is introduced for classifying texts. Five evaluation functions are combined to extract key phrases. Concept phrases, as well as the descriptions of final clusters, are presented using WordNet origin from key phrases. Initial centers and membership matrix are the most important factors affecting clustering performance. Orthogonal concept topic sub-spaces are built with the topic concept phrases representing topics of the texts and the initialization of centers and the membership matrix depend on the concept vectors in sub-spaces. The results show that, different from random initialization of traditional fuzzy c-means clustering, the initialization related to text content contributions can improve clustering precision.

基于改进FCM的冲压件缺陷图像分割算法

在工业质检过程中,冲压件缺陷图像分割作为缺陷检测的重要环节,直接影响缺陷检测效果。而传统的模糊C均值(FCM)聚类算法未考虑到空间邻域信息,对于噪声干扰较为敏感,导致分割精度较差,且其整体易受初始值的影响,造成收敛速度变慢。针对上述问题,提出一种改进的FCM算法。采用内核诱导距离中的简单两项代替传统的欧氏距离,将原有的空间像素映射到高维特征空间,提高线性可分概率和计算速度;利用图像像素之间的空间相关性,通过引入改进的马尔可夫随机场对FCM目标函数进行修正,提高算法的抗噪能力以及分割精度;采用秃鹰搜索(BES)算法确定FCM的初始聚类中心,提高算法的收敛速度,同时避免算法陷入局部极值的情况。为验证改进FCM算法的性能,选取划分熵、划分系数、Xie_Beni系数以及迭代次数作为评价指标,并与近年来先进的图像分割算法进行对比。实验结果表明,改进FCM算法具有更好的抗噪能力,能得到更好的缺陷分割效果,对工业生产中的冲压件缺陷检测有一定的应用价值。

Substation clustering based on improved KFCM algorithm with adaptive optimal clustering number selection

The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.

A New Method of Wind Turbine Bearing Fault Diagnosis Based on Multi-Masking Empirical Mode Decomposition and Fuzzy C-Means Clustering

Based on Multi-Masking Empirical Mode Decomposition (MMEMD) and fuzzy c-means (FCM) clustering, a new method of wind turbine bearing fault diagnosis FCM-MMEMD is proposed, which can determine the fault accurately and timely. First, FCM clustering is employed to classify the data into different clusters, which helps to estimate whether there is a fault and how many fault types there are. If fault signals exist, the fault vibration signals are then demodulated and decomposed into different frequency bands by MMEMD in order to be analyzed further. In order to overcome the mode mixing defect of empirical mode decomposition (EMD), a novel method called MMEMD is proposed. It is an improvement to masking empirical mode decomposition (MEMD). By adding multi-masking signals to the signals to be decomposed in different levels, it can restrain low-frequency components from mixing in highfrequency components effectively in the sifting process and then suppress the mode mixing. It has the advantages of easy implementation and strong ability of suppressing modal mixing. The fault type is determined by Hilbert envelope finally. The results of simulation signal decomposition showed the high performance of MMEMD. Experiments of bearing fault diagnosis in wind turbine bearing fault diagnosis proved the validity and high accuracy of the new method.

Improved evidential fuzzy c-means method

Dempster-Shafer evidence theory(DS theory) is widely used in brain magnetic resonance imaging(MRI) segmentation,due to its efficient combination of the evidence from different sources. In this paper, an improved MRI segmentation method,which is based on fuzzy c-means(FCM) and DS theory, is proposed. Firstly, the average fusion method is used to reduce the uncertainty and the conflict information in the pictures. Then, the neighborhood information and the different influences of spatial location of neighborhood pixels are taken into consideration to handle the spatial information. Finally, the segmentation and the sensor data fusion are achieved by using the DS theory. The simulated images and the MRI images illustrate that our proposed method is more effective in image segmentation.

Fuzzy C-Means Clustering Based Phonetic Tied-Mixture HMM in Speech Recognition

A fuzzy clustering analysis based phonetic tied-mixture HMM(FPTM) was presented to decrease parameter size and improve robustness of parameter training. FPTM was synthesized from state-tied HMMs by a modified fuzzy C-means clustering algorithm. Each Gaussian codebook of FPTM was built from Gaussian components within the same root node in phonetic decision tree. The experimental results on large vocabulary Mandarin speech recognition show that compared with conventional phonetic tied-mixture HMM and state-tied HMM with approximately the same number of Gaussian mixtures, FPTM achieves word error rate reductions by 4.84% and 13.02% respectively. Combining the two schemes of mixing weights pruning and Gaussian centers fuzzy merging, a significantly parameter size reduction was achieved with little impact on recognition accuracy.

基于FCM算法的中小型转动设备故障检测研究

针对现有算法在中小型转动设备故障检测中存在的收敛速度慢、故障识别率低等问题,提出一种基于FCM融合算法的故障检测方案研究。对原始故障集做降噪处理,基于模糊熵值理论在多尺度条件下提取故障向量的隶属度;利用GA算法优化FCM算法的迭代性能和收敛性能,分别更新故障特征向量模糊隶属度矩阵和聚类中心矩阵,以达到改善聚类精度,提高故障识别率的目的。实验结果显示,该算法在不同的聚类中心数量及故障类别的条件下,能够获得更好的聚类效果和更高的收敛速度,训练集合和测试集的平均故障识别分别可以达到99.19%和98.23%。

Agent Based Segmentation of the MRI Brain Using a Robust C-Means Algorithm

In the last decade, the MRI (Magnetic Resonance Imaging) image segmentation has become one of the most active research fields in the medical imaging domain. Because of the fuzzy nature of the MRI images, many researchers have adopted the fuzzy clustering approach to segment them. In this work, a fast and robust multi-agent system (MAS) for MRI segmentation of the brain is proposed. This system gets its robustness from a robust c-means algorithm (RFCM) and obtains its fastness from the beneficial properties of agents, such as autonomy, social ability and reactivity. To show the efficiency of the proposed method, we test it on a normal brain brought from the BrainWeb Simulated Brain Database. The experimental results are valuable in both robustness to noise and running times standpoints.

Fault Pattern Recognition based on Kernel Method and Fuzzy C-means

A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the clustering of data sets and fault pattern recognitions. The present method firstly maps the data from their original space to a high dimensional Kernel space which makes the highly nonlinear data in low-dimensional space become linearly separable in Kernel space. It highlights the differences among the features of the data set. Then fuzzy C-means （FCM） is conducted in the Kernel space. Each data is assigned to the nearest class by computing the distance to the clustering center. Finally, test set is used to judge the results. The convergence rate and clustering accuracy are better than traditional FCM. The study shows that the method is effective for the accuracy of pattern recognition on rotating machinery.

融合改进FCM与PFS的知识供需匹配

为提升知识资源的有效配置,缓解用户“知识迷向”问题,设计一套知识供需匹配方法。依据DBSCAN算法确定FCM算法的聚类数目,增强聚类效果;基于改进FCM进行区域划分实现匹配空间压缩,提升算法效率。在此基础上,构建模糊关联匹配度模型,通过融合Zadeh与PFS模糊算子改进相似度计算,兼顾用户需求与既有知识间的相关度,确定匹配结果。实验分析表明,其在知识匹配有效性方面具有一定的比较优势。

A NEW UNSUPERVISED CLASSIFICATION ALGORITHM FOR POLARIMETRIC SAR IMAGES BASED ON FUZZY SET THEORY

In this letter, a new method is proposed for unsupervised classification of terrain types and man-made objects using POLarimetric Synthetic Aperture Radar (POLSAR) data. This technique is a combi-nation of the usage of polarimetric information of SAR images and the unsupervised classification method based on fuzzy set theory. Image quantization and image enhancement are used to preprocess the POLSAR data. Then the polarimetric information and Fuzzy C-Means (FCM) clustering algorithm are used to classify the preprocessed images. The advantages of this algorithm are the automated classification, its high classifica-tion accuracy, fast convergence and high stability. The effectiveness of this algorithm is demonstrated by ex-periments using SIR-C/X-SAR (Spaceborne Imaging Radar-C/X-band Synthetic Aperture Radar) data.

A KNN-based two-step fuzzy clustering weighted algorithm for WLAN indoor positioning

Although k-nearest neighbors （KNN） is a popular fingerprint match algorithm for its simplicity and accuracy, because it is sensitive to the circumstances, a fuzzy c-means （FCM） clustering algorithm is applied to improve it. Thus, a KNN-based two-step FCM weighted （KTFW） algorithm for indoor positioning in wireless local area networks （WLAN） is presented in this paper. In KTFW algorithm, k reference points （RPs） chosen by KNN are clustered through FCM based on received signal strength （RSS） and location coordinates. The right clusters are chosen according to rules, so three sets of RPs are formed including the set of k RPs chosen by KNN and are given different weights. RPs supposed to have better contribution to positioning accuracy are given larger weights to improve the positioning accuracy. Simulation results indicate that KTFW generally outperforms KNN and its complexity is greatly reduced through providing initial clustering centers for FCM.

Alternative Fuzzy Cluster Segmentation of Remote Sensing Images Based on Adaptive Genetic Algorithm

Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.

AN UNSUPERVISED CLASSIFICATION FOR FULLY POLARIMETRIC SAR DATA USING SPAN/H/α IHSL TRANSFORM AND THE FCM ALGORITHM

In this paper, the IHSL transform and the Fuzzy C-Means (FCM) segmentation algorithm are combined together to perform the unsupervised classification for fully polarimetric Synthetic Ap-erture Rader (SAR) data. We apply the IHSL colour transform to H/α/SPANspace to obtain a new space (RGB colour space) which has a uniform distinguishability among inner parameters and contains the whole polarimetric information in H/α/SPAN.Then the FCM algorithm is applied to this RGB space to finish the classification procedure. The main advantages of this method are that the parameters in the color space have similar interclass distinguishability, thus it can achieve a high performance in the pixel based segmentation algorithm, and since we can treat the parameters in the same way, the segmentation procedure can be simplified. The experiments show that it can provide an improved classification result compared with the method which uses the H/α/SPANspace di-rectly during the segmentation procedure.

Semi-supervised kernel FCM algorithm for remote sensing image classification

These problems of nonlinearity, fuzziness and few labeled data were rarely considered in traditional remote sensing image classification. A semi-supervised kernel fuzzy C-means （SSKFCM） algorithm is proposed to overcome these disadvantages of remote sensing image classification in this paper. The SSKFCM algorithm is achieved by introducing a kernel method and semi-supervised learning technique into the standard fuzzy C-means （FCM） algorithm. A set of Beijing-1 micro-satellite＇s multispectral images are adopted to be classified by several algorithms, such as FCM, kernel FCM （KFCM）, semi-supervised FCM （SSFCM） and SSKFCM. The classification results are estimated by corresponding indexes. The results indicate that the SSKFCM algorithm significantly improves the classification accuracy of remote sensing images compared with the others.

基于FCM算法的多属性分析技术在河道砂体精细刻画中的应用——以西湖凹陷T气田为例

西湖凹陷T气田经过十多年的勘探与开发,亟需在主力层花港组内寻找潜力目标。该区为浅水三角洲沉积体系,岩性组合在空间上变化快,为了精确识别河道砂体及其边界,在海上少井条件下利用三维地震资料识别并刻画河道砂体。在等时地层划分的基础上,对目的层段进行岩石物理性质分析,通过地震沉积学的技术方法结合岩芯及测井等资料,对沉积微相做出初步判断,在此基础上提取6类48种地震属性,与砂厚及各属性之间进行相关性分析,对地震属性进行优选,将优选出的3种反映地质体边界、岩性较好的地震属性采用基于模糊C-均值(FCM)算法的多属性聚类分析,以达到数据降维、减少冗余的效果,研究分流河道沉积体系的整体展布规律。再进行多属性RGB融合显示,增强河道砂体边界的刻画,结合构造特征以及预测的砂体厚度综合分析,提出有利目标区,为后续油田滚动开发及井位部署提供依据。

Employment Quality EvaluationModel Based on Hybrid Intelligent Algorithm

In order to solve the defect of large error in current employment quality evaluation,an employment quality evaluation model based on grey correlation degree method and fuzzy C-means(FCM)is proposed.Firstly,it analyzes the related research work of employment quality evaluation,establishes the employment quality evaluation index system,collects the index data,and normalizes the index data;Then,the weight value of employment quality evaluation index is determined by Grey relational analysis method,and some unimportant indexes are removed;Finally,the employment quality evaluation model is established by using fuzzy cluster analysis algorithm,and compared with other employment quality evaluation models.The test results show that the employment quality evaluation accuracy of the design model exceeds 93%,the employment quality evaluation error can meet the requirements of practical application,and the employment quality evaluation effect is much better than the comparison model.The comparison test verifies the superiority of the model.