Adding-Point Strategy for Reduced-Order Hypersonic Aerothermodynamics Modeling Based on Fuzzy Clustering

Reduced order models（ROMs） based on the snapshots on the CFD high-fidelity simulations have been paid great attention recently due to their capability of capturing the features of the complex geometries and flow configurations. To improve the efficiency and precision of the ROMs, it is indispensable to add extra sampling points to the initial snapshots, since the number of sampling points to achieve an adequately accurate ROM is generally unknown in prior, but a large number of initial sampling points reduces the parsimony of the ROMs. A fuzzy-clustering-based adding-point strategy is proposed and the fuzzy clustering acts an indicator of the region in which the precision of ROMs is relatively low. The proposed method is applied to construct the ROMs for the benchmark mathematical examples and a numerical example of hypersonic aerothermodynamics prediction for a typical control surface. The proposed method can achieve a 34.5% improvement on the efficiency than the estimated mean squared error prediction algorithm and shows same-level prediction accuracy.

Road Surface Modeling and Representation from Point Cloud Based on Fuzzy Clustering

A scheme for an automatic road surface modeling from a noisy point cloud is presented. The normal vectors of the point cloud are estimated by distance-weighted fitting of local plane. Then, an automatic recognition of the road surface from noise is performed based on the fuzzy clustering of normal vectors, with which the mean value is calculated and the projecting plane of point cloud is created to obtain the geometric model accordingly. Based on fuzzy clustering of the intensity attributed to each point, different objects on the road surface are assigned different colors for representing abundant appearances. This unsupervised method is demonstrated in the experiment and shows great effectiveness in reconstructing and rendering better road surface.

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.

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

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

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

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

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

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

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.

基于主体建模和改进FCM的服务区多能源负荷预测

公路服务区生活建筑的多能源负荷特性预测是交通能源自洽一体化系统集成设计和优化调度的难点和核心任务之一。生活建筑的冷热电负荷与所涉及人员的人口分布特性和生活习惯等因素密切相关,具有显著的群体特征。综合考虑服务区群体特征和用能行为特性,基于主体建模方法建立公路服务区生活建筑负荷预测模型;考虑季节与节假日影响,构建公路服务区典型用能场景;应用改进的模糊C均值聚类算法和平均值法提取得到公路服务区生活建筑的冷热电负荷曲线。服务区能源负荷预测案例模拟与校核结果表明,该方法确定的多能源负荷预测精度可满足工程实践需求,为集成系统的规划设计和优化调度提供基础。

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.

Fuzzy C-Means Clustering Based Phonetic Tied-Mixture HMM in Speech Recognition

A fuzzy clustering analysis based phonetic tied-mixture HMM(FPTM) was presented to decrease parameter size and improve robustness of parameter training. FPTM was synthesized from state-tied HMMs by a modified fuzzy C-means clustering algorithm. Each Gaussian codebook of FPTM was built from Gaussian components within the same root node in phonetic decision tree. The experimental results on large vocabulary Mandarin speech recognition show that compared with conventional phonetic tied-mixture HMM and state-tied HMM with approximately the same number of Gaussian mixtures, FPTM achieves word error rate reductions by 4.84% and 13.02% respectively. Combining the two schemes of mixing weights pruning and Gaussian centers fuzzy merging, a significantly parameter size reduction was achieved with little impact on recognition accuracy.

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.

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.

基于FCM聚类的光伏储能容量配置方法研究

为提升分布式光伏储能容量配置的合理性,提出基于模糊C均值(FCM)聚类的光伏储能容量配置方法。通过分析分布式光伏系统拓扑结构,将分析结果作为信息依据,制定相应的分布式光伏储能容量配置方案。从分布式电源投资者及电网管理者角度制定目标及约束条件,构建分布式光伏储能容量配置模型。采用FCM聚类算法对配置模型内迭代计算的初值实施有效分配。该算法能够抑制光伏储能大容量蓄电池波动、提高储能性能和效率,从而获取最优容量配置。所提方法可以在短时间内实现储能出力,使光伏自消纳率平均值达到93.5%。该方法的分布式光伏储能容量配置效果较好。

基于LMD近似熵和FCM聚类的机械故障诊断研究

提出一种基于局部均值分解(local mean decomposition,LMD)近似熵和模糊C均值聚类(fuzzy C-means clustering,FCM)相结合的机械故障诊断方法。首先对机械振动信号进行LMD分解,得到若干具有物理意义的乘积函数(product function,PF)分量,再通过相关性分析,筛选出与原始信号相关性最大的3个分量作为数据源,求取其近似熵作为特征向量,最后通过FCM模糊聚类对特征向量进行识别分类。实验表明,基于LMD近似熵和FCM模糊聚类相结合的方法对机械故障信号能够有效准确地进行识别分类,此外,将该方法与基于EMD近似熵和FCM结合的方法进行对比,结果表明该方法具有更好的故障识别效果。

一种基于三角模糊数多指标信息的FCM聚类算法

针对一类具有不确定性三角模糊数多指标信息的聚类分析问题,基于传统的数值信息FCM聚类算法,提出一种新的聚类分析算法.首先描述了具有三角模糊数多指标信息的聚类分析问题,提出并证明了基于三角模糊数多指标信息的关于最优划分和最优聚类中心确定的两个定理;然后根据这两个定理,进一步给出了基于三角模糊数信息的FCM聚类算法的迭代步骤;最后通过一个算例说明了该聚类算法的具体应用.

模糊C-均值(FCM)聚类算法的实现

传统的FCM算法能够将靠近边界的具有固有形状的两个簇合并成为一个大的簇。然而,对于一些稍微复杂的数据,如果没有其它的像去除小簇之类的机制的话,FCM算法很难将非常接近的类聚类到一起。给出的聚类算法是在传统FCM算法的循环之后添加了去除掉空簇的步骤,解决了上述很难将非常接近的类聚到一个簇中的问题。另外,为便于选出最优结果,在递归之后又添加了计算聚类有效性的步骤。最后用Java实现了该算法并在数据集上进行了实验,证实了改进方法的有效性。

结合FCMS与变分水平集的图像分割模型

提出了一个结合融合空间约束的模糊C均值(Fuzzy C means with spatial constraints,FCMS)聚类与变分水平集的图像模糊聚类分割模型.在该模型中引入了一个基于图像局部信息和空间信息的外部模糊聚类能量,从而可以获取精确的局部图像的空间特征,使得本文模型对噪声图像的聚类分割具有较强的鲁棒性.采用不同类型的实验图像,将本文模型与10个不同类型的图像分割模型进行了对比实验,实验结果显示本文模型能克服图像中噪声影响并取得较满意的聚类分割结果.

半监督FCM聚类算法目标函数研究

分析了现有半监督FCM算法目标函数的物理意义和平衡系数α的选取,说明Stutz对Pedrycz目标函数的修改使半监督的物理意义更清楚,它在α=1,0时均退化为标准FCM算法,给出了修改后SS-FCM算法的交替求解过程。实验结果:(1)修改算法与Pedrycz算法有相同的半监督作用和清楚的物理解释;(2)对labeled样本采用FCM算法赋值比用随机数的收敛稳定性高;(3)优选的少量labeled样本,使用模糊协方差的SS-CFCM算法提高了聚类准确性和收敛速度。