基于K近邻隶属度的聚类算法研究

经典模糊C均值聚类算法（FCM）基于欧氏距离,存在不同规模类簇不能正确聚类问题,针对此问题提出一种基于[K]近邻隶属度的模糊C均值聚类算法（KNN_FCM）。讨论了基于[K]近邻隶属度的粗糙C均值聚类算法（KNN_RCM）和粗糙模糊C均值聚类算法（KNN_RFCM）,此方法避免了传统粗糙C均值聚类算法（RCM）和粗糙模糊C均值聚类算法（RFCM）中阈值选择问题。将KNN_FCM、KNN_RCM、KNN_RFCM分别与FCM、RFM、RFCM在UCI数据集上进行仿真比较,结果表明新方法是可行、有效的。     

基于ELM的局部空间信息的模糊C均值聚类图像分割算法

极限学习机（Extreme learning machine, ELM）作为一种新技术具有在回归和分类中良好的泛化性能。局部空间信息的模糊C均值算法(Weighted fuzzy local information C-means, WFLICM)用邻域像素点的空间信息标记中心点的影响因子,增强了模糊C均值聚类算法的去噪声能力。基于极限学习机理论,对WFLICM进行改进优化,提出了基于ELM的局部空间信息的模糊C均值聚类图像分割算法(New kernel weighted fuzzy local information C-means based on ELM,ELM-NKWFLICM)。该方法基于ELM特征映射技术,将原始数据通过ELM特征映射技术映射到高维ELM隐空间中,再用改进的新核局部空间信息的模糊C均值聚类图像分割算法(New kernel weighted fuzzy local information C-means,NKWFLICM)进行聚类。 实验结果表明 ELM-NKWFLICM算法具有比WFLICM算法更强的去噪声能力,且很好地保留了原图像的细节,算法在处理复杂非线性数据时更高效, 同时克服了模糊聚类算法对模糊指数的敏感性问题。     

模糊C均值聚类图像分割的改进遗传算法研究

基于模糊C均值（FCM）聚类算法,并利用遗传算法全局随机搜索的特点,提出了一种图像分割的改进遗传算法。该算法首先采用一种初值化算法确定合适的遗传算法的初始搜索范围,然后对遗传算法中的编码方式、交叉算子、变异算子等参数进行了一些适当改进,进而给出了该算法的理论推导和算法的具体实现步骤。该算法除了解决模糊C均值聚类算法在医学图像分割中容易陷入局部最优解的问题,而且采用的初值化算法比标准的遗传模糊C均值聚类算法能确定更合适的遗传算法的初始搜索范围,从而加速了遗传算法的收敛过程。实验表明,该方法相对于标准的遗传模糊C均值聚类算法,效果要好得多。     

基于模糊C均值算法的云南草药聚类分析

针对云南草药识别方法的简单性、不科学性问题,提出一种基于模糊C均值算法的聚类方法。利用高效液相色谱法提取云南特色草药肉桂的指纹图谱,再通过模糊C均值算法对指纹图谱数据进行聚类。通过与传统K均值算法进行对比,实验结果证明模糊C均值算法具有较高的分类识别能力。     

多层递阶融合模糊特征映射的模糊C均值聚类算法

针对复杂非线性数据的无监督学习问题,提出一种新型的映射方式来有效提高算法对复杂非线性数据的学习能力。以TSK模糊系统的规则前件学习为基础,提出一种新型的模糊特征映射新方法。接着,针对映射之后的数据维度过大问题,引入多层递阶融合的概念,进一步提出基于多层递阶融合的模糊特征映射新方法,从而有效避免了因单层模糊特征映射之后特征维数过高而导致的数据混乱和冗余的问题。最后与模糊C均值算法相结合,提出基于多层递阶融合模糊特征映射的模糊C均值聚类算法。实验研究表明,文中算法相比于经典模糊聚类方法,有着更加优越、稳定的性能。     

K-近邻估计协同系数的协同模糊C均值算法

针对现有协同模糊C均值算法（CFC）的协同系数不能充分描述数据子集间协同关系的问题,提出K-近邻估计协同系数的协同模糊C均值算法[(βK-CFC)]。用模糊C均值算法（FCM）求出各数据子集的隶属度和聚类中心;其次设定近邻数,求出子集在各聚类中心处的密度,形成密度矩阵;根据密度矩阵的相关性设定变化的协同系数;最后用变化的协同系数进行协同聚类。实验证明K-近邻估计协同系数的协同模糊C均值算法[(βK-CFC)]能够充分描述数据子集间的协同关系,聚类性能较好。     

引入RNA计算的遗传模糊C均值聚类算法

模糊C均值算法（FCM）在聚类分析中是目前比较流行和应用比较广泛的一种算法。但它存在两个弱点：一是对初始化非常敏感,容易陷入局部极值点;二是处理大数据集时耗时太长。基于RNA的分子计算是近年来新兴的一种智能优化计算方法。提出了基于RNA计算的遗传模糊聚类算法（RNAGAFCM）,来提高收敛速度和全局寻优能力。仿真实验表明新算法比现有的遗传模糊聚类算法减少了迭代次数,提高了收敛速度。     

基于马氏距离特征加权的模糊聚类新算法

模糊聚类分析是模糊模式识别中一个重要研究领域,而其中最经典的模糊C均值算法认为样本矢量各特征对聚类结果贡献均匀,没有考虑不同的属性特征对模式分类的不同影响,在处理属性高相关的数据集时,该算法分错率增加。针对这些问题,提出了一种基于马氏距离特征加权的模糊聚类算法,利用自适应马氏距离的优点对特征加权处理,对高属性相关的数据集进行更有效的分类。实验证明该方法的可行性和有效性。     

基于密度函数加权的模糊C均值聚类算法研究

模糊聚类算法具有较强的实用性,但传统模糊C均值算法（FCM）具有对样本集进行等划分趋势的缺陷,没有考虑不同样本的实际分布对聚类效果的影响,当数据集中各样本密集程度相差较大时,聚类结果不是很理想。因此,提出一种基于密度函数加权的模糊C均值聚类算法（DFCM算法）,该算法利用数据对象的密度函数作为每个数据点权值。实验结果表明,与传统的模糊C均值算法相比,DFCM算法具有较好的聚类效果。     

基于MapReduce的并行模糊C均值算法

模糊C均值是一种重要的软聚类算法,针对模糊C均值的随着数据量的增加,时间复杂度过高的缺点,提出了一种基于MapReduce的并行模糊C均值算法。算法重新设计模糊C均值,使其符合MapReduce的基于key/value的编程模型,并行计算数据集到中心点的隶属度,并重新计算出新的聚类中心,提高了模糊C均值处理大容量数据的计算效率。实验结果表明,基于MapReduce的并行模糊C均值算法具有较高的加速比和扩展性。     

基于混合粒子群优化算法的入侵检测研究

针对在入侵检测方法中常用的模糊聚类方法自身难以克服的对初始值敏感、容易陷入局部最优等问题,提出一种将粒子群优化算法和模糊聚类方法相结合的混合算法.对实验数据进行仿真试验,并将实验结果与其他算法结果相比较,显示出混合算法在入侵检测中能获得较好的检测能力.     

An Integrated Artificial Neural Network Fuzzy C-Means-Normalization Algorithm for performance assessment of decision-making units: The cases of auto industry and power plant

Efficiency frontier analysis has been an important approach of evaluating firms’ performance in private and public sectors. There have been many efficiency frontier analysis methods reported in the literature. However, the assumptions made for each of these methods are restrictive. Each of these methodologies has its strength as well as major limitations. This study proposes two non-parametric efficiency frontier analysis sub-algorithms based on (1) Artificial Neural Network (ANN) technique and (2) ANN and Fuzzy C-Means for measuring efficiency as a complementary tool for the common techniques of the efficiency studies in the previous studies. Normal probability plot is used to find the outliers and select from these two methods. The proposed computational algorithms are able to find a stochastic frontier based on a set of input–output observational data and do not require explicit assumptions about the functional structure of the stochastic frontier. In these algorithms, for calculating the efficiency scores, a similar approach to econometric methods has been used. Moreover, the effect of the return to scale of decision-making unit (DMU) on its efficiency is included and the unit used for the correction is selected by notice of its scale (under constant return to scale assumption). Also in the second algorithm, for increasing DMUs’ homogeneousness, Fuzzy C-Means method is used to cluster DMUs. Two examples using real data are presented for illustrative purposes. First example which deals with power generation sector shows the superiority of Algorithm 2 while the second example dealing auto industries of various developed countries shows the superiority of Algorithm 1. Overall, we find that the proposed integrated algorithm based on ANN, Fuzzy C-Means and Normalization approach provides more robust results and identifies more efficient units than the conventional methods since better performance patterns are explored.     

电信用户呼叫行为的模糊聚类研究

电信用户的通话行为聚类分析是一个新的研究领域,属于数据挖掘范畴。为了对用户行为进行有针对性的分析挖掘,发现客户行为中隐藏的、有用的、未曾预料的知识,采用了模糊C均值(FCM)聚类算法,以模糊数学理论知识作为客户行为聚类分析的方法,为电信企业客户分析提供了量化依据,并采用Matlab为计算工具,给出了一个聚类分析实例,并初步建立了通话行为模型识别机制。实验证明,本文采用的模糊聚类方法得到了满意的分析结果。     

基于Levy飞行的萤火虫模糊聚类算法

针对模糊C均值（FCM）聚类算法易受初始聚类中心影响而陷入局部最优问题,提出了一种基于Levy飞行的萤火虫模糊聚类算法（LFAFCM）。该算法改变萤火虫算法的随机移动策略,以平衡算法局部搜索和全局搜索能力;萤火虫位置更新过程中引入Levy飞行机制,以提高全局寻优能力;根据迭代次数和萤火虫位置动态调整每个萤火虫的尺度系数,以限制Levy飞行可搜索范围,并加快算法收敛速度。利用5个UCI数据集对算法进行实验验证,实验结果表明,该算法有效避免了陷入局部最优并具有较快的收敛速度。     

Modified possibilistic fuzzy C-means algorithms for segmentation of magnetic resonance image

The brain magnetic resonance (MR) image has an embedded bias field. This field needs to be corrected to obtain the actual MR image for classification. Bias field, being a slowly varying nonlinear field, needs to be estimated. In this paper, we have proposed three schemes and in turn three algorithms to segment the given MR image while estimating the bias field. The problem is compounded when the MR image is corrupted with noise in addition to the inherent bias field. The notions of possibilistic and fuzzy membership have been combined to take care of the modeling of the bias field and noise. The weighted typicality measure together with the weighted fuzzy membership has been used to model the image. The above resulted in the proposed Bias Corrected Possibilistic Fuzzy C-Means (BCPFCM) strategy and the algorithm. Further reinforcing the neighbourhood data to the modeling aspect has resulted in the two other strategies namely Bias Corrected Possibilistic Neighborhood Fuzzy C-Means (BCPNFCM) and Bias Corrected Separately weighted Possibilistic Neighborhood Fuzzy C-Means (BCSPNFCM). The proposed algorithms have successfully been tested with synthetic data with bias field of low and high spatial frequency. Noisy brain MR images with Gaussian Noise of varying strength have been considered from the BrainWeb database. The algorithms have also been tested on real brain MR data set with axial and sagittal view and it has been found that the proposed algorithms produced segmentation results with less percentage of misclassification errors as compared to the Bias Corrected Fuzzy C-Means (BCFCM) algorithm proposed by Ahmed et al. [4]. The performance of the proposed algorithms has been compared with algorithms from other paradigm in the context of Tanimoto's index.     

特征逐减的可能性模糊聚类算法

模糊C均值聚类（FCM）和可能性模糊C均值聚类（PFCM）没有考虑样本特征项及每个样本对聚类的贡献程度，存在对噪声较敏感的问题。特征减少的模糊聚类算法FRFCM可剔除数据集中无效特征量，且考虑了剩余特征量的权重，具有更好的聚类性能。对此，在可能性模糊C均值聚类算法（PFCM）的基础上将其与FRFCM算法相结合，提出新的特征逐减的可能性模糊C均值聚类算法（FRPFCM）。该算法解决了PFCM算法参数依赖的问题，且在迭代过程中可自动淘汰无效特征项并更新各特征项对聚类的贡献程度。对人工数据集以及UCI数据集进行测试的结果表明，提出的FRPFCM算法可得到更高的聚类准确率，所需迭代次数更少，算法收敛速度更快。     

Fuzzy Clustering Using A Compensated Fuzzy Hopfield Network

Hopfield neural networks are well known for cluster analysis with an unsupervised learning scheme. This class of networks is a set of heuristic procedures that suffers from several problems such as not guaranteed convergence and output depending on the sequence of input data. In this paper, a Compensated Fuzzy Hopfield Neural Network (CFHNN) is proposed which integrates a Compensated Fuzzy C-Means (CFCM) model into the learning scheme and updating strategies of the Hopfield neural network. The CFCM, modified from Penalized Fuzzy C-Means algorithm (PFCM), is embedded into a Hopfield net to avoid the NP-hard problem and to speed up the convergence rate for the clustering procedure. The proposed network also avoids determining values for the weighting factors in the energy function. In addition, its training scheme enables the network to learn more rapidly and more effectively than FCM and PFCM. In experimental results, the CFHNN method shows promising results in comparison with FCM and PFCM methods.     

基于自适应模糊聚类分析的目标冗余信息处理

针对雷达接收机检测后输出的大量点迹数据,讨论了点迹的空间散布状态和目标冗余现 象的形成原因,提出了自适应模糊C均值聚类(AFCMC)算法进行检测点迹的凝聚处理,为目标冗余 处理提供了一条途径,仿真结果验证了该算法的有效性。     

基于自适应模糊C-均值的增量式聚类算法

针对模糊C-均值（FCM）算法不能很好地处理更新数据的缺点,提出基于FCM的自适应增量式聚类算法AIFCM。该算法结合密度和集合的思想,给出一种自动确定聚类初始中心的方法,能在聚类过程中动态改变聚类结果数,改善聚类的质量,减少人为的主观因素,获得比较符合用户需求的聚类结果,并能在原有聚类结果的基础上简单有效地处理更新数据,过滤噪声数据,较好地避免大量重复计算。