Fuzzy Fruit Fly Optimized Node Quality-Based Clustering Algorithm for Network Load Balancing

Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.

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.

NEW SHADOWED C-MEANS CLUSTERING WITH FEATURE WEIGHTS

Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the prototype of each cluster. By integrating feature weights, a formula for weight calculation is introduced to the clustering algorithm. The selection of weight exponent is crucial for good result and the weights are updated iteratively with each partition of clusters. The convergence of the weighted algorithms is given, and the feasible cluster validity indices of data mining application are utilized. Experimental results on both synthetic and real-life numerical data with different feature weights demonstrate that the weighted algorithm is better than the other unweighted algorithms.

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.

Fault Diagnosis Model Based on Fuzzy Support Vector Machine Combined with Weighted Fuzzy Clustering

A fault diagnosis model is proposed based on fuzzy support vector machine (FSVM) combined with fuzzy clustering (FC).Considering the relationship between the sample point and non-self class,FC algorithm is applied to generate fuzzy memberships.In the algorithm,sample weights based on a distribution density function of data point and genetic algorithm (GA) are introduced to enhance the performance of FC.Then a multi-class FSVM with radial basis function kernel is established according to directed acyclic graph algorithm,the penalty factor and kernel parameter of which are optimized by GA.Finally,the model is executed for multi-class fault diagnosis of rolling element bearings.The results show that the presented model achieves high performances both in identifying fault types and fault degrees.The performance comparisons of the presented model with SVM and distance-based FSVM for noisy case demonstrate the capacity of dealing with noise and generalization.

CONSIDERING NEIGHBORHOOD INFORMATION IN IMAGE FUZZY CLUSTERING

Fuzzy C-means clustering algorithm is a classical non-supervised classification method.For image classification, fuzzy C-means clustering algorithm makes decisions on a pixel-by-pixel basis and does not take advantage of spatial information, regardless of the pixels' correlation. In this letter, a novel fuzzy C-means clustering algorithm is introduced, which is based on image's neighborhood system. During classification procedure, the novel algorithm regards all pixels'fuzzy membership as a random field. The neighboring pixels' fuzzy membership information is used for the algorithm's iteration procedure. As a result, the algorithm gives a more smooth classification result and cuts down the computation time.

Research on Wind Power Prediction Modeling Based on Adaptive Feature Entropy Fuzzy Clustering

Wind farm power prediction is proposed based on adaptive feature weight entropy fuzzy clustering algorithm.According to the fuzzy clustering method,a large number of historical data of a wind farm in Inner Mongolia are analyzed and classified.Model of adaptive entropy weight for clustering is built.Wind power prediction model based on adaptive entropy fuzzy clustering feature weights is built.Simulation results show that the proposed method could distinguish the abnormal data and forecast more accurately and compute fastly.

A weighted fuzzy C-means clustering method for hardness prediction

The hardness prediction model was established by support vector regression(SVR).In order to avoid exaggerating the contribution of very tiny alloying elements,a weighted fuzzy C-means(WFCM)algorithm was proposed for data clustering using improved Mahalanobis distance based on random forest importance values,which could play a full role of important features and avoid clustering center overlap.The samples were divided into two classes.The top 10 features of each class were selected to form two feature subsets for better performance of the model.The dimension and dispersion of features decreased in such feature subsets.Comparing four machine learning algorithms,SVR had the best performance and was chosen to modeling.The hyper-parameters of the SVR model were optimized by particle swarm optimization.The samples in validation set were classified according to minimum distance of sample to clustering centers,and then the SVR model trained by feature subset of corresponding class was used for prediction.Compared with the feature subset of original data set,the predicted values of model trained by feature subsets of classified samples by WFCM had higher correlation coefficient and lower root mean square error.It indicated that WFCM was an effective method to reduce the dispersion of features and improve the accuracy of model.

Improved method for the feature extraction of laser scanner using genetic clustering

Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.

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.

Clustering： from Clusters to Knowledge

Data analysis and automatic processing is often interpreted as knowledge acquisition. In many cases it is necessary to somehow classify data or find regularities in them. Results obtained in the search of regularities in intelligent data analyzing applications are mostly represented with the help of IF-THEN rules. With the help of these rules the following tasks are solved： prediction, classification, pattern recognition and others. Using different approaches---clustering algorithms, neural network methods, fuzzy rule processing methods--we can extract rules that in an understandable language characterize the data. This allows interpreting the data, finding relationships in the data and extracting new rules that characterize them. Knowledge acquisition in this paper is defined as the process of extracting knowledge from numerical data in the form of rules. Extraction of rules in this context is based on clustering methods K-means and fuzzy C-means. With the assistance of K-means, clustering algorithm rules are derived from trained neural networks. Fuzzy C-means is used in fuzzy rule based design method. Rule extraction methodology is demonstrated in the Fisher＇s Iris flower data set samples. The effectiveness of the extracted rules is evaluated. Clustering and rule extraction methodology can be widely used in evaluating and analyzing various economic and financial processes.

Interactive Protein Data Clustering

In this paper, the authors present three different algorithms for data clustering. These are Self-Organizing Map （SOM）, Neural Gas （NG） and Fuzzy C-Means （FCM） algorithms. SOM and NG algorithms are based on competitive leaming. An important property of these algorithms is that they preserve the topological structure of data. This means that data that is close in input distribution is mapped to nearby locations in the network. The FCM algorithm is an algorithm based on soft clustering which means that the different clusters are not necessarily distinct, but may overlap. This clustering method may be very useful in many biological problems, for instance in genetics, where a gene may belong to different clusters. The different algorithms are compared in terms of their visualization of the clustering of proteomic data.

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.

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.

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.

基于属性权重的Fuzzy C Mean算法

提出CF-WFCM算法,该算法分为属性权重学习算法和聚类算法两部分.属性权重学习算法,从数据自身的相似性出发,通过梯度递减算法极小化属性评价函数CFuzziness(w),为每个属性赋予一个权重.将属性权重应用于Fuzzy C Mean聚类算法,得到CF-WFCM算法的聚类算法.CF-WFCM算法强化重要属性在聚类过程中的作用,消减冗余属性的作用,从而改善聚类的效果.我们选取了部分UCI数据库进行实验,实验结果证明:CF-WFCM算法的聚类结果优于FCM算法的聚类结果.函数CFuzziness(w)不仅可以评价属性的重要性,而且可以评价属性评价函数的优劣.实验说明了这一问题.最后我们对CF-WFCM算法进行了讨论.

Intelligent diagnosis of the solder bumps defects using fuzzy C-means algorithm with the weighted coefficients

Solder bump technology has been widely used in electronic packaging. With the development of solder bumps towards higher density and finer pitch, it is more difficult to inspect the defects of solder bumps as they are hidden in the package. A nondestructive method using the transient active thermography has been proposed to inspect the defects of a solder bump, and we aim at developing an intelligent diagnosis system to eliminate the influence of emissivity unevenness and non-uniform heating on defects recognition in active infrared testing. An improved fuzzy c-means(FCM) algorithm based on the entropy weights is investigated in this paper. The captured thermograms are preprocessed to enhance the thermal contrast between the defective and good bumps. Hot spots corresponding to 16 solder bumps are segmented from the thermal images. The statistical features are calculated and selected appropriately to characterize the status of solder bumps in FCM clustering. The missing bump is identified in the FCM result, which is also validated by the principle component analysis. The intelligent diagnosis system using FCM algorithm with the entropy weights is effective for defects recognition in electronic packages.

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.