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.

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.

Knowledge-Driven Possibilistic Clustering with Automatic Cluster Elimination

Traditional Fuzzy C-Means(FCM)and Possibilistic C-Means(PCM)clustering algorithms are data-driven,and their objective function minimization process is based on the available numeric data.Recently,knowledge hints have been introduced to formknowledge-driven clustering algorithms,which reveal a data structure that considers not only the relationships between data but also the compatibility with knowledge hints.However,these algorithms cannot produce the optimal number of clusters by the clustering algorithm itself;they require the assistance of evaluation indices.Moreover,knowledge hints are usually used as part of the data structure(directly replacing some clustering centers),which severely limits the flexibility of the algorithm and can lead to knowledgemisguidance.To solve this problem,this study designs a newknowledge-driven clustering algorithmcalled the PCM clusteringwith High-density Points(HP-PCM),in which domain knowledge is represented in the form of so-called high-density points.First,a newdatadensitycalculation function is proposed.The Density Knowledge Points Extraction(DKPE)method is established to filter out high-density points from the dataset to form knowledge hints.Then,these hints are incorporated into the PCM objective function so that the clustering algorithm is guided by high-density points to discover the natural data structure.Finally,the initial number of clusters is set to be greater than the true one based on the number of knowledge hints.Then,the HP-PCM algorithm automatically determines the final number of clusters during the clustering process by considering the cluster elimination mechanism.Through experimental studies,including some comparative analyses,the results highlight the effectiveness of the proposed algorithm,such as the increased success rate in clustering,the ability to determine the optimal cluster number,and the faster convergence speed.

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.

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.

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.

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.

Modified possibilistic clustering model based on kernel methods

A novel model of fuzzy clustering using kernel methods is proposed. This model is called kernel modified possibilistic c-means （KMPCM） model. The proposed model is an extension of the modified possibilistic c-means （MPCM） algorithm by using kernel methods. Different from MPCM and fuzzy c-means （FCM） model which are based on Euclidean distance, the proposed model is based on kernel-induced distance. Furthermore, with kernel methods the input data can be mapped implicitly into a high-dimensional feature space where the nonlinear pattern now appears linear. It is unnecessary to do calculation in the high-dimensional feature space because the kernel function can do it. Numerical experiments show that KMPCM outperforms FCM and MPCM.

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.

结合ECM和FCM聚类的遥感图像分割新方法

模糊C均值算法(FCM)具有良好的聚类性能从而被广泛应用于图像分割领域,但其存在距离测度鲁棒性差、需预先给出初始聚类数目、未考虑图像局部相关特性等问题。本质上讲,FCM算法是一种局部搜索优化算法,如果初始值选择不当,不仅需要更多的迭代次数,而且会收敛到局部最优解。针对上述问题,结合进化聚类(ECM)和FCM算法,提出了一种遥感图像分割的新方法。利用ECM解决模糊C均值聚类算法的初始化中心选择问题,再利用FCM算法对获得的聚类中心进行优化,完成模糊聚类划分,通过去模糊化转换为确定性分类,实现聚类分割。实验结果表明,该方法能以较少的迭代次数收敛到全局最优解,具有较好的稳定性和鲁棒性,有较好的分割效果,提高了遥感图像分割方法的效率。

Track-Pattern-Based Characteristics of Extratropical Transitioning Tropical Cyclones in the Western North Pacific

Based on the Regional Specialized Meteorological Center(RSMC)Tokyo-Typhoon Center best-track data and the NCEP-NCAR reanalysis dataset,extratropical transitioning(ET)tropical cyclones(ETCs)over the western North Pacific(WNP)during 1951–2021 are classified into six clusters using the fuzzy c-means clustering method(FCM)according to their track patterns.The characteristics of the six hard-clustered ETCs with the highest membership coefficient are shown.Most tropical cyclones(TCs)that were assigned to clusters C2,C5,and C6 made landfall over eastern Asian countries,which severely threatened these regions.Among landfalling TCs,93.2%completed their ET after landfall,whereas 39.8%of ETCs completed their transition within one day.The frequency of ETCs over the WNP has decreased in the past four decades,wherein cluster C5 demonstrated a significant decrease on both interannual and interdecadal timescales with the expansion and intensification of the western Pacific subtropical high(WPSH).This large-scale circulation pattern is favorable for C2 and causes it to become the dominant track pattern,owning to it containing the largest number of intensifying ETCs among the six clusters,a number that has increased insignificantly over the past four decades.The surface roughness variation and three-dimensional background circulation led to C5 containing the maximum number of landfalling TCs and a minimum number of intensifying ETCs.Our results will facilitate a better understanding of the spatiotemporal distributions of ET events and associated environment background fields,which will benefit the effective monitoring of these events over the WNP.

Adaptive Image Digital Watermarking with DCT and FCM

A novel adaptive digital image watermark algorithm is proposed. Fuzzy c-means clustering （FCM） is used to classify the original image blocks into two classes based on several characteristic parameters of human visual system （HVS）. One is suited for embedding a digital watermark, the other is not. So the appropriate blocks in an image are selected to embed the watermark. The wetermark is embedded in the middle-frequency part of the host image in conjunction with HVS and discrete cosine transform （DCT）. The maximal watermark strength is fixed according to the frequency masking. In the same time, for the good performance, the watermark is modulated into a fractal modulation array. The simulation results show that we can remarkably extract the hiding watermark and the algorithm can achieve good robustness with common signal distortion or geometric distortion and the quality of the watermarked image is guaranteed.

Fast global kernel fuzzy c-means clustering algorithm for consonant/vowel segmentation of speech signal

We propose a novel clustering algorithm using fast global kernel fuzzy c-means-F(FGKFCM-F), where F refers to kernelized feature space. This algorithm proceeds in an incremental way to derive the near-optimal solution by solving all intermediate problems using kernel-based fuzzy c-means-F(KFCM-F) as a local search procedure. Due to the incremental nature and the nonlinear properties inherited from KFCM-F, this algorithm overcomes the two shortcomings of fuzzy c-means(FCM): sen- sitivity to initialization and inability to use nonlinear separable data. An accelerating scheme is developed to reduce the compu-tational complexity without significantly affecting the solution quality. Experiments are carried out to test the proposed algorithm on a nonlinear artificial dataset and a real-world dataset of speech signals for consonant/vowel segmentation. Simulation results demonstrate the effectiveness of the proposed algorithm in improving clustering performance on both types of datasets.

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.

基于改进FCM聚类算法的高速公路交通状态识别

为有效识别高速公路交通状态,提高路网服务水平,基于改进的模糊C均值(Fuzzy CMeans,FCM)聚类算法对高速公路交通数据进行分析。首先,采用熵权法确定交通流量、空间占有率、平均速度和路网充裕度4个交通状态分类指标的权重,并对每个样本赋予不同的加权系数。然后,将样本权重计算纳入算法迭代过程,进而实现高速公路交通状态识别。最后,比较改进FCM算法与传统FCM算法的目标函数值、迭代次数及运行时间,结果表明:与传统FCM算法相比,改进FCM算法的目标函数值较小,迭代次数较少,运行时间较短,在数据中表现出更好的适应性;由改进FCM算法得到的聚类结果能准确、全面地反映交通数据的变化情况,实现道路交通状态的有效识别。

A new measuring method for maximal length, width and thickness dimensions of coarse aggregates

In order to establish a new method for measuring the dimensions of coarse aggregates, five different-size flat and elongated (F&E) coarse aggregates were glued into two specimens by epoxy resin, respectively, and slice images were obtained by X-ray CT, then the aggregates were extracted by the fuzzy c-means clustering algorithm. Attributions of the particle on different cross-sections were determined by the ‘overlap area method’. And unified three-dimensional Cartesian coordinate system was established based on continuous slice images. The coefficient values of spherical harmonics descriptor representing particles surface profile were gained, then each scanned particle was represented by 60×120 discrete points conformably with spherical harmonics descriptor. The chord length and direction angles were determined by the calculation. With the major axis (L) and orthogonal axis (W and T), the calculated results were compared with those measured by caliper. It is concluded that the new L, W, and T dimension measuring method is able to take the place of the present manual measurement.

Automated measurement of three-dimensional cerebral cortical thickness in Alzheimer’s patients using localized gradient vector trajectory in fuzzy membership maps

Our purpose in this study was to develop an automated method for measuring three-dimensional (3D) cerebral cortical thicknesses in patients with Alzheimer’s disease (AD) using magnetic resonance (MR) images. Our proposed method consists of mainly three steps. First, a brain parenchymal region was segmented based on brain model matching. Second, a 3D fuzzy membership map for a cerebral cortical region was created by applying a fuzzy c-means (FCM) clustering algorithm to T1-weighted MR images. Third, cerebral cortical thickness was three- dimensionally measured on each cortical surface voxel by using a localized gradient vector trajectory in a fuzzy membership map. Spherical models with 3 mm artificial cortical regions, which were produced using three noise levels of 2%, 5%, and 10%, were employed to evaluate the proposed method. We also applied the proposed method to T1-weighted images obtained from 20 cases, i.e., 10 clinically diagnosed AD cases and 10 clinically normal (CN) subjects. The thicknesses of the 3 mm artificial cortical regions for spherical models with noise levels of 2%, 5%, and 10% were measured by the proposed method as 2.953 ± 0.342, 2.953 ± 0.342 and 2.952 ± 0.343 mm, respectively. Thus the mean thicknesses for the entire cerebral lobar region were 3.1 ± 0.4 mm for AD patients and 3.3 ± 0.4 mm for CN subjects, respectively (p < 0.05). The proposed method could be feasible for measuring the 3D cerebral cortical thickness on individual cortical surface voxels as an atrophy feature in AD.

新冠疫情下国际班列通道综合风险测算

为分析并测算全球新型冠状病毒肺炎(COVID-19)疫情下以中欧、中亚班列为代表的国际班列通道的综合风险,便于决策者因险施策、防患于未然。首先,构建疫情下通道沿线节点国家综合风险评价指标体系,采用模糊C均值(FCM)聚类算法对沿线国家风险等级进行分类;然后,综合考虑节点间风险的相互影响,构建通道风险测算模型;最后,利用蒙特卡罗法进行仿真试验,计算不同通道去向、返程班列的风险得分。结果表明:中欧班列中/东向通道风险最高,中亚班列南向通道、新通道通行风险相对较小,需有效开拓南向通道和新通道,分担通道货运高风险。

Fuzzy Clustering with Novel Separable Criterion

Fuzzy clustering has been used widely in pattern recognition, image processing, and data analysis An improved fuzzy clustering algorithm was developed based on the conventional fuzzy c-means （FCM） to obtain better quality clustering results. The update equations for the membership and the cluster center are derived from the alternating optimization algorithm. Two fuzzy scattering matrices in the objective function assure the compactness between data points and cluster centers, and also strengthen the separation between cluster centers in terms of a novel separable criterion. The clustering algorithm properties are shown to be an improvement over the FCM method＇s properties. Numerical simulations show that the clustering algorithm gives more accurate clustering results than the FCM method.

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.