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.

Partition region-based suppressed fuzzy C-means algorithm

Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.

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.

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.

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.

Abnormal State Detection of OLTC Based on Improved Fuzzy C-means Clustering

An accurate extraction of vibration signal characteristics of an on-load tap changer(OLTC)during contact switching can effectively help detect its abnormal state.Therefore,an improved fuzzy C-means clustering method for abnormal state detection of the OLTC contact is proposed.First,the wavelet packet and singular spectrum analysis are used to denoise the vibration signal generated by the moving and static contacts of the OLTC.Then,the Hilbert-Huang transform that is optimized by the ensemble empirical mode decomposition(EEMD)is used to decompose the vibration signal and extract the boundary spectrum features.Finally,the gray wolf algorithm-based fuzzy C-means clustering is used to denoise the signal and determine the abnormal states of the OLTC contact.An analysis of the experimental data shows that the proposed secondary denoising method has a better denoising effect compared to the single denoising method.The EEMD can improve the modal aliasing effect,and the improved fuzzy C-means clustering can effectively identify the abnormal state of the OLTC contacts.The analysis results of field measured data further verify the effectiveness of the proposed method and provide a reference for the abnormal state detection of the OLTC.

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.

Research of Improved Fuzzy c-means Algorithm Based on a New Metric Norm

For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly.

Advanced Fuzzy C-Means Algorithm Based on Local Density and Distance

This paper presents an advanced fuzzy C-means(FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of the data separation or the size of clusters. The advanced FCM algorithm combines the distance with density and improves the objective function so that the performance of the algorithm can be improved. The experimental results show that the proposed FCM algorithm requires fewer iterations yet provides higher accuracy than the traditional FCM algorithm. The advanced algorithm is applied to the influence of stars' box-office data, and the classification accuracy of the first class stars achieves 92.625%.

Integrated parallel forecasting model based on modified fuzzy time series and SVM

A dynamic parallel forecasting model is proposed, which is based on the problem of current forecasting models and their combined model. According to the process of the model, the fuzzy C-means clustering algorithm is improved in outliers operation and distance in the clusters and among the clusters. Firstly, the input data sets are optimized and their coherence is ensured, the region scale algorithm is modified and non-isometric multi scale region fuzzy time series model is built. At the same time, the particle swarm optimization algorithm about the particle speed, location and inertia weight value is improved, this method is used to optimize the parameters of support vector machine, construct the combined forecast model, build the dynamic parallel forecast model, and calculate the dynamic weight values and regard the product of the weight value and forecast value to be the final forecast values. At last, the example shows the improved forecast model is effective and accurate.

Improved Kernel Possibilistic Fuzzy Clustering Algorithm Based on Invasive Weed Optimization

Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.

Fuzzy identification of nonlinear dynamic system based on selection of important input variables

Input variables selection(IVS) is proved to be pivotal in nonlinear dynamic system modeling. In order to optimize the model of the nonlinear dynamic system, a fuzzy modeling method for determining the premise structure by selecting important inputs of the system is studied. Firstly, a simplified two stage fuzzy curves method is proposed, which is employed to sort all possible inputs by their relevance with outputs, select the important input variables of the system and identify the structure.Secondly, in order to reduce the complexity of the model, the standard fuzzy c-means clustering algorithm and the recursive least squares algorithm are used to identify the premise parameters and conclusion parameters, respectively. Then, the effectiveness of IVS is verified by two well-known issues. Finally, the proposed identification method is applied to a realistic variable load pneumatic system. The simulation experiments indi cate that the IVS method in this paper has a positive influence on the approximation performance of the Takagi-Sugeno(T-S) fuzzy modeling.

基于改进S-FCM和PSO算法的WSN分簇路由算法

为了改善无线传感器网络(Wireless Sensor Network,WSN)节点能耗不均衡和大规模网络环境下模糊C-均值算法收敛速度缓慢的问题,提出一种基于改进抑制式模糊C-均值和粒子群算法的无线传感器网络分簇路由算法(WSN Clustering Routing Algorithm based on Improved S-FCM and PSO Algorithms,CRIS-FCMP)。在成簇阶段,利用抑制式模糊C-均值的目标函数构建不固定抑制率修正节点隶属度,以保证良好分簇效果,加快算法收敛速度。簇首选举阶段,依据簇内节点的能量关系设定节点动态能量阈值,并按照距离因素选举簇首。数据传输阶段,综合考虑能量因素、距离因素及负载因素设计路由路径适应度函数,并结合粒子群算法为簇首规划最优路由路径,以进一步均衡节点能耗。仿真结果表明,所提的改进算法能加快分簇的速度。

3D reconstruction method based on contour features

To guarantee the accuracy and real-time of the 3D reconstruction method for outdoor scene,an algorithm based on region segmentation and matching was proposed.Firstly,on the basis of morphological gradient information,obtained by comparing color weight gradient images and proposing a multi-threshold segmentation,scene contour features were extracted by a watershed algorithm and a fuzzy c-means clustering algorithm.Secondly,to reduce the search area,increase the correct matching ratio and accelerate the matching speed,the region constraint was established according to a region＇s local position,area and gray characteristics,the edge pixel constraint was established according to the epipolar constraint and the continuity constraint.Finally,by using the stereo matching edge pixel pairs,their 3D coordinates were estimated according to the binocular stereo vision imaging model.Experimental results show that the proposed method can yield a high stereo matching ratio and reconstruct a 3D scene quickly and efficiently.

Three-dimensional gravity inversion based on optimization processing from edge detection

Gravity inversion requires much computation,and inversion results are often non-unique.The first problem is often due to the large number of grid cells.Edge detection method,i.e.,tilt angle method of analytical signal amplitude(TAS),helps to identify the boundaries of underground geological anomalies at different depths,which can be used to optimize the grid and reduce the number of grid cells.The requirement of smooth inversion is that the boundaries of the meshing area should be continuous rather than jagged.In this paper,the optimized meshing strategy is improved,and the optimized meshing region obtained by the TAS is changed to a regular region to facilitate the smooth inversion.For the second problem,certain constraints can be used to improve the accuracy of inversion.The results of analytic signal amplitude(ASA)are used to delineate the central distribution of geological bodies.We propose a new method using the results of ASA to perform local constraints to reduce the non-uniqueness of inversion.The guided fuzzy c-means(FCM)clustering algorithm combined with priori petrophysical information is also used to reduce the non-uniqueness of gravity inversion.The Open Acc technology is carried out to speed up the computation for parallelizing the serial program on GPU.In general,the TAS is used to reduce the number of grid cells.The local weighting and priori petrophysical constraint are used in conjunction with the FCM algorithm during the inversion,which improves the accuracy of inversion.The inversion is accelerated by the Open Acc technology on GPU.The proposed method is validated using synthetic data,and the results show that the efficiency and accuracy of gravity inversion are greatly improved by using the proposed method.

Automatic segmentation algorithm for high-spatial-resolution remote sensing images based on self-learning super-pixel convolutional network

Super-pixel algorithms based on convolutional neural networks with fuzzy C-means clustering are widely used for high-spatial-resolution remote sensing images segmentation.However,this model requires the number of clusters to be set manually,resulting in a low automation degree due to the complexity of the iterative clustering process.To address this problem,a segmentation method based on a self-learning super-pixel network(SLSP-Net)and modified automatic fuzzy clustering(MAFC)is proposed.SLSP-Net performs feature extraction,non-iterative clustering,and gradient reconstruction.A lightweight feature embedder is adopted for feature extraction,thus expanding the receiving range and generating multi-scale features.Automatic matching is used for non-iterative clustering,and the overfitting of the network model is overcome by adaptively adjusting the gradient weight parameters,providing a better irregular super-pixel neighborhood structure.An optimized density peak algorithm is adopted for MAFC.Based on the obtained super-pixel image,this maximizes the robust decision-making interval,which enhances the automation of regional clustering.Finally,prior entropy fuzzy C-means clustering is applied to optimize the robust decision-making and obtain the final segmentation result.Experimental results show that the proposed model offers reduced experimental complexity and achieves good performance,realizing not only automatic image segmentation,but also good segmentation results.