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.

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.

Diabetic Retinopathy Diagnosis Using ResNet with Fuzzy Rough C-Means Clustering

Diabetic Retinopathy(DR)is a vision disease due to the long-term prevalenceof Diabetes Mellitus.It affects the retina of the eye and causes severedamage to the vision.If not treated on time it may lead to permanent vision lossin diabetic patients.Today’s development in science has no medication to cureDiabetic Retinopathy.However,if diagnosed at an early stage it can be controlledand permanent vision loss can be avoided.Compared to the diabetic population,experts to diagnose Diabetic Retinopathy are very less in particular to local areas.Hence an automatic computer-aided diagnosis for DR detection is necessary.Inthis paper,we propose an unsupervised clustering technique to automatically clusterthe DR into one of its five development stages.The deep learning based unsupervisedclustering is made to improve itself with the help of fuzzy rough c-meansclustering where cluster centers are updated by fuzzy rough c-means clusteringalgorithm during the forward pass and the deep learning model representationsare updated by Stochastic Gradient Descent during the backward pass of training.The proposed method was implemented using python and the results were takenon DGX server with Tesla V100 GPU cards.An experimental result on the publicallyavailable Kaggle dataset shows an overall accuracy of 88.7%.The proposedmodel improves the accuracy of DR diagnosis compared to the existingunsupervised algorithms like k-means,FCM,auto-encoder,and FRCM withalexnet.

Paraspinal Muscle Segmentation in CT Images Using GSM-Based Fuzzy C-Means Clustering

Minimally Invasive Spine surgery (MISS) was developed to treat disorders of the spine with less disruption to the muscles. Surgeons use CT images to monitor the volume of muscles after operation in order to evaluate the progress of patient recovery. The first step in the task is to segment the muscle regions from other tissues/organs in CT images. However, manual segmentation of muscle regions is not only inaccurate, but also time consuming. In this work, Gray Space Map (GSM) is used in fuzzy c-means clustering algorithm to segment muscle regions in CT images. GSM com- bines both spatial and intensity information of pixels. Experiments show that the proposed GSM- based fuzzy c-means clustering muscle CT image segmentation yields very good results.

Automated Colorization of Grayscale Images Using Texture Descriptors and a Modified Fuzzy C-Means Clustering

A novel example-based process for Automated Colorization of grayscale images using Texture Descriptors (ACTD) without any human intervention is proposed. By analyzing a set of sample color images, coherent regions of homogeneous textures are extracted. A multi-channel filtering technique is used for texture-based image segmentation, combined with a modified Fuzzy C-means (FCM) clustering algorithm. This modified FCM clustering algorithm includes both the local spatial information from neighboring pixels, and the spatial Euclidian distance to the cluster’s center of gravity. For each area of interest, state-of-the-art texture descriptors are then computed and stored, along with corresponding color information. These texture descriptors and the color information are used for colorization of a grayscale image with similar textures. Given a grayscale image to be colorized, the segmentation and feature extraction processes are repeated. The texture descriptors are used to perform Content-Based Image Retrieval (CBIR). The colorization process is performed by Chroma replacement. This research finds numerous applications, ranging from classic film restoration and enhancement, to adding valuable information into medical and satellite imaging. Also, this can be used to enhance the detection of objects from x-ray images at the airports.

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.

A Novel Soft Clustering Method for Detection of Exudates

One of the earliest indications of diabetes consequence is Diabetic Retinopathy(DR),the main contributor to blindness worldwide.Recent studies have proposed that Exudates(EXs)are the hallmark of DR severity.The present study aims to accurately and automatically detect EXs that are difficult to detect in retinal images in the early stages.An improved Fusion of Histogram-Based Fuzzy C-Means Clustering(FHBFCM)by a New Weight Assignment Scheme(NWAS)and a set of four selected features from stages of pre-processing to evolve the detection method is proposed.The features of DR train the optimal parameter of FHBFCM for detecting EXs diseases through a stepwise enhancement method through the coarse segmentation stage.The histogram-based is applied to find the color intensity in each pixel and performed to accomplish Red,Green,and Blue(RGB)color information.This RGB color information is used as the initial cluster centers for creating the appropriate region and generating the homogeneous regions by Fuzzy C-Means(FCM).Afterward,the best expression of NWAS is used for the delicate detection stage.According to the experiment results,the proposed method successfully detects EXs on the retinal image datasets of DiaretDB0(Standard Diabetic Retinopathy Database Calibration level 0),DiaretDB1(Standard Diabetic Retinopathy Database Calibration level 1),and STARE(Structured Analysis of the Retina)with accuracy values of 96.12%,97.20%,and 93.22%,respectively.As a result,this study proposes a new approach for the early detection of EXs with competitive accuracy and the ability to outperform existing methods by improving the detection quality and perhaps significantly reducing the segmentation of false positives.

Study on the Development and Implementation of Different Big Data Clustering Methods

Clustering is an unsupervised learning method used to organize raw data in such a way that those with the same (similar) characteristics are found in the same class and those that are dissimilar are found in different classes. In this day and age, the very rapid increase in the amount of data being produced brings new challenges in the analysis and storage of this data. Recently, there is a growing interest in key areas such as real-time data mining, which reveal an urgent need to process very large data under strict performance constraints. The objective of this paper is to survey four algorithms including K-Means algorithm, FCM algorithm, EM algorithm and BIRCH, used for data clustering and then show their strengths and weaknesses. Another task is to compare the results obtained by applying each of these algorithms to the same data and to give a conclusion based on these results.

Gene Coding Sequence Identification Using Kernel Fuzzy C-Mean Clustering and Takagi-Sugeno Fuzzy Model

Sequence analysis technology under big data provides unprecedented opportunities for modern life science. A novel gene coding sequence identification method is proposed in this paper. Firstly, an improved short-time Fourier transform algorithm based on Morlet wavelet is applied to extract the power spectrum of DNA sequence. Then, threshold value determination method based on kernel fuzzy C-mean clustering is used to combine Signal to Noise Ratio (SNR) data of exon and intron into a sequence, classify the sequence into two types, calculate the weighted sum of two SNR clustering centers obtained and the discrimination threshold value. Finally, exon interval endpoint identification algorithm based on Takagi-Sugeno fuzzy identification model is presented to train Takagi-Sugeno model, optimize model parameters with Levenberg-Marquardt least square method, complete model and determine fuzzy rule. To verify the effectiveness of the proposed method, example tests are conducted on typical gene sequence sample data.

Soil pore identification with the adaptive fuzzy C-means method based on computed tomography images

The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically and accurately. Until recently, there have not been methods to identify soil pore structures. This has restricted the development of soil science, particularly regarding pore geometry and spatial distribution. Through the adoption of the fuzzy clustering theory and the establishment of pore identification rules, a novel pore identification method is described to extract pore structures from CT soil images. The robustness of the adaptive fuzzy C-means method (AFCM), the adaptive threshold method, and Image-Pro Plus tools were compared on soil specimens under different conditions, such as frozen, saturated, and dry situations. The results demonstrate that the AFCM method is suitable for identifying pore clusters, especially tiny pores, under various soil conditions. The method would provide an optional technique for the study of soil micromorphology.

A fast and effective fuzzy clustering algorithm for color image segmentation

A fast and effective fuzzy clustering algorithm is proposed. The algorithm splits an image into n × n blocks, and uses block variance to judge whether the block region is homogeneous. Mean and center pixel of each homogeneous block are extracted for feature. Each inhomogeneous block is split into separate pixels and the mean of neighboring pixels within a window around each pixel and pixel value are extracted for feature. Then cluster of homogeneous blocks and cluster of separate pixels from inhomogeneous blocks are carried out respectively according to different membership functions. In fuzzy clustering stage, the center pixel and center number of the initial clustering are calculated based on histogram by using mean feature. Then different membership functions according to comparative result of block variance are computed. Finally, modified fuzzy c-means with spatial information to complete image segmentation axe used. Experimental results show that the proposed method can achieve better segmental results and has shorter executive time than many well-known methods.

Kernel method-based fuzzy clustering algorithm

The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.

Research and Implementation of the Enterprise Evaluation Based on a Fusion Clustering Model of AHP-FCM

Traditional clustering method is easy to slow convergence speed because of high data dimension and setting random initial clustering center. To improve these problems, a novel method combining subtractive clustering with fuzzy C-means( FCM)clustering will be advanced. In the method, the initial cluster number and cluster center can be obtained using subtractive clustering. On this basis,clustering result will be further optimized with FCM. In addition,the data dimension will be reduced through the analytic hierarchy process( AHP) before clustering calculating.In order to verify the effectiveness of fusion algorithm,an example about enterprise credit evaluation will be carried out. The results show that the fusion clustering algorithm is suitable for classifying high-dimension data,and the algorithm also does well in running up processing speed and improving visibility of result. So the method is suitable to promote the use.

Liver Segmentation from CT Image Using Fuzzy Clustering and Level Set

This paper presents a fully automatic segmentation method of liver CT scans using fuzzy c-mean clustering and level set. First, the contrast of original image is enhanced to make boundaries clearer;second, a spatial fuzzy c-mean clustering combining with anatomical prior knowledge is employed to extract liver region automatically;thirdly, a distance regularized level set is used for refinement;finally, morphological operations are used as post-processing. The experiment result shows that the method can achieve high accuracy (0.9986) and specificity (0.9989). Comparing with standard level set method, our method is more effective in dealing with over-segmentation problem.

Instance reduction for supervised learning using input-output clustering method

A method that applies clustering technique to reduce the number of samples of large data sets using input-output clustering is proposed.The proposed method clusters the output data into groups and clusters the input data in accordance with the groups of output data.Then,a set of prototypes are selected from the clustered input data.The inessential data can be ultimately discarded from the data set.The proposed method can reduce the effect from outliers because only the prototypes are used.This method is applied to reduce the data set in regression problems.Two standard synthetic data sets and three standard real-world data sets are used for evaluation.The root-mean-square errors are compared from support vector regression models trained with the original data sets and the corresponding instance-reduced data sets.From the experiments,the proposed method provides good results on the reduction and the reconstruction of the standard synthetic and real-world data sets.The numbers of instances of the synthetic data sets are decreased by 25%-69%.The reduction rates for the real-world data sets of the automobile miles per gallon and the 1990 census in CA are 46% and 57%,respectively.The reduction rate of 96% is very good for the electrocardiogram(ECG) data set because of the redundant and periodic nature of ECG signals.For all of the data sets,the regression results are similar to those from the corresponding original data sets.Therefore,the regression performance of the proposed method is good while only a fraction of the data is needed in the training process.

Comparison of Clustering Methods in Yeast Saccharomyces Cerevisiae

In recent years, microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for discovering groups of correlated genes potentially co-regulated or associated to the disease or conditions under investigation. Many clustering methods including k-means, fuzzy c-means, and hierarchical clustering have been widely used in literatures. Yet no comprehensive comparative study has been performed to evaluate the effectiveness of these methods, specially, in yeast saccharomyces cerevisiae. In this paper, these three gene clustering methods are compared. Classification accuracy and CPU time cost are employed for measuring performance of these algorithms. Our results show that hierarchical clustering outperforms k-means and fuzzy c-means clustering. The analysis provides deep insight to the complicated gene clustering problem of expression profile and serves as a practical guideline for routine microarray cluster analysis of gene expression.

Different Feature Selection of Soil Attributes Influenced Clustering Performance on Soil Datasets

Feature selection is very important to obtain meaningful and interpretive clustering results from a clustering analysis. In the application of soil data clustering, there is a lack of good understanding of the response of clustering performance to different features subsets. In the present paper, we analyzed the performance differences between k-means, fuzzy c-means, and spectral clustering algorithms in the conditions of different feature subsets of soil data sets. The experimental results demonstrated that the performances of spectral clustering algorithm were generally better than those of k-means and fuzzy c-means with different features subsets. The feature subsets containing environmental attributes helped to improve clustering performances better than those having spatial attributes and produced more accurate and meaningful clustering results. Our results demonstrated that combination of spectral clustering algorithm with the feature subsets containing environmental attributes rather than spatial attributes may be a better choice in applications of soil data clustering.

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.

A User-Transformer Relation Identification Method Based on QPSO and Kernel Fuzzy Clustering

User-transformer relations are significant to electric power marketing,power supply safety,and line loss calculations.To get accurate user-transformer relations,this paper proposes an identification method for user-transformer relations based on improved quantum particle swarm optimization(QPSO)and Fuzzy C-Means Clustering.The main idea is:as energymeters at different transformer areas exhibit different zero-crossing shift features,we classify the zero-crossing shift data from energy meters through Fuzzy C-Means Clustering and compare it with that at the transformer end to identify user-transformer relations.The proposed method contributes in three main ways.First,based on the fuzzy C-means clustering algorithm(FCM),the quantum particle swarm optimization(PSO)is introduced to optimize the FCM clustering center and kernel parameters.The optimized FCM algorithm can improve clustering accuracy and efficiency.Since easily falls into a local optimum,an improved PSO optimization algorithm(IQPSO)is proposed.Secondly,considering that traditional FCM cannot solve the linear inseparability problem,this article uses a FCM(KFCM)that introduces kernel functions.Combinedwith the IQPSOoptimization algorithm used in the previous step,the IQPSO-KFCM algorithm is proposed.Simulation experiments verify the superiority of the proposed method.Finally,the proposed method is applied to transformer detection.The proposed method determines the class members of transformers and meters in the actual transformer area,and obtains results consistent with actual user-transformer relations.This fully shows that the proposed method has practical application value.