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.

Global Optimization Method Using SLE and Adaptive RBF Based on Fuzzy Clustering

High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.

Refracturing candidate selection for MFHWs in tight oil and gas reservoirs using hybrid method with data analysis techniques and fuzzy clustering

The selection of refracturing candidate is one of the most important jobs faced by oilfield engineers. However, due to the complicated multi-parameter relationships and their comprehensive influence, the selection of refracturing candidate is often very difficult. In this paper, a novel approach combining data analysis techniques and fuzzy clustering was proposed to select refracturing candidate. First, the analysis techniques were used to quantitatively calculate the weight coefficient and determine the key factors. Then, the idealized refracturing well was established by considering the main factors. Fuzzy clustering was applied to evaluate refracturing potential. Finally, reservoirs numerical simulation was used to further evaluate reservoirs energy and material basis of the optimum refracturing candidates. The hybrid method has been successfully applied to a tight oil reservoir in China. The average steady production was 15.8 t/d after refracturing treatment, increasing significantly compared with previous status. The research results can guide the development of tight oil and gas reservoirs effectively.

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.

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.

Water quality assessment for Ulansuhai Lake using fuzzy clustering and pattern recognition

Water quality assessment of lakes is important to determine functional zones of water use.Considering the fuzziness during the partitioning process for lake water quality in an arid area,a multiplex model of fuzzy clustering with pattern recognition was developed by integrating transitive closure method,ISODATA algorithm in fuzzy clustering and fuzzy pattern recognition.The model was applied to partition the Ulansuhai Lake,a typical shallow lake in arid climate zone in the west part of Inner Mongolia,China and grade the condition of water quality divisions.The results showed that the partition well matched the real conditions of the lake,and the method has been proved accurate in the application.

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.

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.

AN ANALYSIS OF THE APPLICABILITY OF FUZZY CLUSTERING IN ESTABLISHING AN INDEX FOR THE EVALUATION OF METEOROLOGICAL SERVICE SATISFACTION

An evaluation index is a prerequisite for the scientific evaluation of a public meteorological service.This paper aims to explore a technical method for determining and screening evaluation indicators.Based on public satisfaction survey data obtained in Wafangdian,China in 2010,this study investigates the suitability of fuzzy clustering analysis method in establishing an evaluation index.Through quantitative analysis of multilayer fuzzy clustering of various evaluation indicators,correlation analysis indicates that if the results of clustering were identical for two evaluation indicators in the same sub-evaluation layer,then one indicator could be removed,or the two indicators merged.For evaluation indicators in different sub-evaluation layers,although clustering reveals attribute correlations,these indicators may not be substituted for one another.Analysis of the applicability of the fuzzy clustering method shows that it plays a certain role in the establishment and correction of an evaluation index.

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.

A New Algorithm for Black-start Zone Partitioning Based on Fuzzy Clustering Analysis

On the process of power system black start after an accident, it can help to optimize the resources allocation and accelerate the recovery process that decomposing the power system into several independent partitions for parallel recovery. On the basis of adequate consideration of fuzziness of black-start zone partitioning, a new algorithm based on fuzzy clustering analysis is presented. Characteristic indexes are extracted fully and accurately. The raw data matrix is made up of the electrical distance between every nodes and blackstart resources. Closure transfer method is utilized to get the dynamic clustering. The availability and feasibility of the proposed algorithm are verified on the New-England 39 bus system at last.

农业机器人采摘目标识别技术研究——基于FCM模糊聚类算法

介绍了FCM(Fuzzy C-Means)模糊聚类算法的原理,采用权重分配的方法对该算法进行了改进,通过建立模糊的相似矩阵,对目标对象的特征聚类图进行分析,并引入隶属度矩阵对FCM算法进行优化,以加快算法的迭代速度。实验结果表明:农业机器人采用该方法对农作物轮廓分割识别度较高,算法计算效率较快,验证了其可靠性,该方法可用于目标农作物的分割和目标识别。

基于GWO-FCM的输油泵故障诊断模型自学习框架

随着输油泵场站无人化建设的发展,企业对输油泵故障诊断技术的要求也越来越高。目前,被广泛使用的利用机器学习算法进行输油泵故障诊断的方法都只能针对模型训练集中已包含的几类故障进行诊断,在企业的实际使用中,仍会出现其他不包含在训练集中的故障而不能被正确自动识别、诊断。针对上述问题,设计了一种输油泵故障诊断模型自学习框架,通过信号处理技术结合深度学习提取深层故障特征,提高工业现场数据的可分性;通过模糊C均值聚类结合相似度度量判别已知故障和未知故障,对出现的未知故障模式进行识别和记录;利用频繁出现的未知故障数据重训练模型,在原有诊断功能的基础上提高对未知故障的识别、诊断及学习能力。为验证方法的有效性,使用工业现场采集的输油泵数据进行实验,结果表明,现有诊断方法所提出的输油泵故障诊断模型自学习框架能够实现对未知故障的准确识别。

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

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

Improvements to the fuzzy mathematics comprehensive quantitative method for evaluating fault sealing

Fuzzy mathematics is an important means to quantitatively evaluate the properties of fault sealing in petroleum reservoirs.To accurately study fault sealing,the comprehensive quantitative evaluation method of fuzzy mathematics is improved based on a previous study.First,the single-factor membership degree is determined using the dynamic clustering method,then a single-factor evaluation matrix is constructed using a continuous grading function,and finally,the probability distribution of the evaluation grade in a fuzzy evaluation matrix is analyzed.In this study,taking the F1 fault located in the northeastern Chepaizi Bulge as an example,the sealing properties of faults in different strata are quantitatively evaluated using both an improved and an un-improved comprehensive fuzzy mathematics quantitative evaluation method.Based on current oil and gas distribution,it is found that our evaluation results before and after improvement are significantly different.For faults in＂best＂and＂poorest＂intervals,our evaluation results are consistent with oil and gas distribution.However,for the faults in＂good＂or＂poor＂intervals,our evaluation is not completelyconsistent with oil and gas distribution.The improved evaluation results reflect the overall and local sealing properties of target zones and embody the nonuniformity of fault sealing,indicating the improved method is more suitable for evaluating fault sealing under complicated conditions.

Clustering Analysis of the Basic Structure of Relevant Community Service Organizations in Cities in China

With the gradually development of economy in China, people＇s living stan- dards have been improved, which makes people have higher and higher require- ments on the quality of life, and thus community service has become and essential part in people＇s life. In order to understand the basic building blocks of community service organizations in different cities in China, classification comparison was made to the data of 31 cities in China from China Statistical Year Book （2014） by using SPSS clustering method and the fuzzy clustering method, so as to find out the dif- ferences and the causes of the differences, with the aim to promote the manage- ment of relevant government and personnel.

An Airborne Radar Clutter Tracking Algorithm Based on Multifractal and Fuzzy C-Mean Cluster

For an airborne Iookdown radar, clutter power often changes dynamically about 80 dB with wide distributions as the platform moves. Therefore, clutter tracking techniques are required to guide the selection of const false alarm rate （CFAR） schemes. In this work, clutter tracking is done in image domain and an algorithm combining multifractal and fuzzy C-mean （FCM） cluster is proposed. The clutter with large dynamic distributions in power density is converted to steady distributions of multifractal exponents by the multifractal transformation with the optimum moment. Then, later, the main lobe and side lobe are tracked from the multifractal exponents by FCM clustering method.

Kernel Generalized Noise Clustering Algorithm

To deal with the nonlinear separable problem, the generalized noise clustering （GNC） algorithm is extended to a kernel generalized noise clustering （KGNC） model. Different from the fuzzy c-means （FCM） model and the GNC model which are based on Euclidean distance, the presented model is based on kernel-induced distance by using kernel method. By kernel method the input data are nonlinearly and implicitly mapped into a high-dimensional feature space, where the nonlinear pattern appears linear and the GNC algorithm is performed. It is unnecessary to calculate in high-dimensional feature space because the kernel function can do it just in input space. The effectiveness of the proposed algorithm is verified by experiments on three data sets. It is concluded that the KGNC algorithm has better clustering accuracy than FCM and GNC in clustering data sets containing noisy data.

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.