自适应约束模糊C均值聚类算法

针对经典C均值聚类算法和模糊C均值聚类算法所存在的对初始聚类中心过分依赖以及需要预先知道实际聚类数目的问题,基于模糊C均值聚类算法提出了一种新算法:自适应约束模糊C均值(ACFCM)聚类算法,它在模糊C均值聚类算法的基础上,给目标函数加入了一个惩罚项,使得上述问题得以解决.并通过仿真实验证实了新算法的可行性和有效性.     

基于改进量子遗传优化的模糊C均值聚类图像分割

针对模糊C均值聚类算法对初始聚类中心值敏感和抗噪声能力差的问题,提出一种基于改进的量子遗传优化初始聚类中心的算法,改进双链编码的量子遗传算法增加了全局搜索能力,改变传统的FCM算法计算迭代慢和易陷入局部极值的问题.同时引入空间邻域信息,利用加权隶属度矩阵建立适应度函数来改善对噪声的鲁棒性,实验结果表明,算法具有很好的分割效果和较强的抗噪能力.     

一种基于CS-FCM算法的模糊时间序列预测模型

为了发挥模糊理论在不确定性预测中的优势并保留模糊时间序列(FTS)预测模型的可解释性,本文针对目前应用广泛的模糊C均值聚类(FCM)算法进行改进,提出了一种基于布谷鸟搜索的FCM (CS-FCM)算法.将CS-FCM算法用于模糊时间序列模型的非均匀论域划分与数据的模糊化处理,建立一种基于CS-FCM算法的模糊时间序列预测模型.该算法可实现聚类中心的全局寻优,降低传统FCM算法易陷入局部极小值带来的误差,提高模型预测精度.实证分析结果表明, CS-FCM算法的适应度优于FCM算法,本文模型的预测误差小于经典模糊时间序列预测模型,验证了新预测模型的有效性.     

模糊C均值算法的改进

模糊聚类分析方法具有较强的实用性,但传统的模糊C均值算法对数据集进行分类时有均分的趋势,对于数据集中各类样本数目相差较大的情况,其聚类结果不是很理想.因此,本文对FCM算法进行了改进,使之不但能够达到更好的分类效果,同时也更加适用于样本分类不均衡的聚类问题.文中还结合具体算例进行了聚类分析,得到了理想的分类效果.     

硬聚类和模糊聚类的结合——双层FCM快速算法

模糊c均值(FCM)聚类算法在模式识别领域中得到了广泛的应用,但FCM算法在大数据集的情况下需要大量的CPU时间,令用户感到十分不便,提高算法的速度是一个急待解决的问题。本文提出的双层FCM聚类算法是一种快速算法,它体现了硬聚类和模糊聚类的结合,以硬聚类的结果对模糊聚类的初始值进行指导,从而明显地缩短了迭代过程。双层FCM算法所用的CPU时间仅为FCM算法的十三分之一,因而具有很强的实用价值。     

土壤分类的模糊集成算法与应用

土壤是一个多性状的连续体,其分类的首选方法是模糊聚类分析.但是模糊聚类分析中现有的基于模糊等价关系的动态聚类法和模糊c-均值法各有利弊,采用其中一种方法聚类肯定存在不足.为此集成两种聚类方法的优点,避其缺点,提出了用基于模糊等价关系的动态聚类方法和方差分析方法确定聚类数目和初始聚类中心,再用模糊c-均值法决定最终分类结果的集成算法,并将其应用到松花江流域土壤分类中,得到了较为切合实际的分类结果.     

改进的遗传模糊聚类算法

对基于遗传算法的FCM(模糊c^-均值法)聚类算法进行了改进,能更好地把遗传算法的全局搜索能力和FCM的局部搜索能力结合起来。实验结果表明，这种改进的算法在分类正确率和稳定性上优于[1]和[3]中的方法；收敛速度和对初值的敏感性都明显优于FCM。     

FCM聚类算法中模糊加权指数m的优选方法

模糊c-均值(FCM)聚类算法是一种通过目标函数的极小化来获得数据集模糊划分的方法。其中，模糊加权指数m对FCM算法的分类性能有着重要的影响，而调用FCM算法进行模糊聚类分析时又必须给m赋值。因此，模糊加权指数m的优选研究就变得很有意义。基于模糊决策的方法本文给出了一种对m的优选方法，实验结果表明该方法是有效的。     

基于混合细菌趋药性的聚类分割算法

为解决模糊C均值算法对初始值敏感、容易陷入局部极值的问题,提出基于混合细菌趋药性的聚类分割算法,在简单细菌趋药性算法的基础上,将粒子群算法引入.新算法使用粒子群算法、细菌趋药性算法两步优化得到的结果作为模糊C均值算法的初始值,同时新算法中引入精英保持策略,进一步提高算法效率.实验结果表明,新算法具有较快的收敛速度,.同时能够获得较好的图像分割效果和质量.     

基于混合单纯形算法的模糊均值图像分割

针对模糊C均值算法用于图像分割时对初始值敏感、容易陷入局部极值的问题,提出基于混合单纯形算法的模糊均值图像分割算法.算法利用Nelder-Mead单纯形算法计算量小、搜索速度快和粒子群算法自适应能力强、具有较好的全局搜索能力的特点,将混合单纯形算法的结果作为模糊C均值算法的输入,并将其用于图像分割.实验结果表明:基于混合单纯形算法的模糊均值图像分割算法在改善图像分割质量的同时,提高了算法的运行速度.     

An new initialization method for fuzzy c-means algorithm

In this paper an initialization method for fuzzy c-means (FCM) algorithm is proposed in order to solve the two problems of clustering performance affected by initial cluster centers and lower computation speed for FCM. Grid and density are needed to extract approximate clustering center from sample space. Then, an initialization method for fuzzy c-means algorithm is proposed by using amount of approximate clustering centers to initialize classification number, and using approximate clustering centers to initialize initial clustering centers. Experiment shows that this method can improve clustering result and shorten clustering time validly.     

Multiobjective improved spatial fuzzy c-means clustering for image segmentation combining Pareto-optimal clusters

In this paper, we propose a grayscale image segmentation method based on a multiobjective optimization approach that optimizes two complementary criteria (region and edge based). The region-based fitness used is the improved spatial fuzzy c-means clustering measure that is shown performing better than the standard fuzzy c-means (FCM) measure. The edge-based fitness used is based on the contour statistics and the number of connected components in the image segmentation result. The optimization algorithm used is the multiobjective particle swarm optimization (MOPSO), which is well suited to handle continuous variables problems, the case of FCM clustering. In our case, each particle of the swarm codes the centers of clusters. The result of the multiobjective optimization technique is a set of Pareto-optimal solutions, where each solution represents a segmentation result. Instead of selecting one solution from the Pareto front, we propose a method that combines all solutions to get a better segmentation. The combination method takes place in two steps. The first step is the detection of high-confidence points by exploiting the similarity between the results and the membership degrees. The second step is the classification of the remaining points by using the high-confidence extracted points. The proposed method was evaluated on three types of images: synthetic images, simulated MRI brain images and real-world MRI brain images. This method was compared to the most widely used FCM-based algorithms of the literature. The results demonstrate the effectiveness of the proposed technique.     

快速均值漂移图像分割算法研究

Mean shift算法是一种搜索与样本点分布最接近模式的非参数统计方法.但它是一种迭代统计方法,要保证较高的数值计算精度需要较多的迭代次数,耗费较长的计算时间.为克服这一缺点,提出快速均值漂移图像分割算法.该算法在每次迭代时以前一次的聚类中心集合T动态地更新样本集S,并通过使用直方图缩小样本点的搜索范围进一步加快算法的收敛速度.实验结果表明该方法在保证图像分割质量的同时具有较快的收敛速度.     

基于三角隶属函数和模糊熵的图像增强方法及其相关应用研究

鉴于图像增强技术在生活应用中的重要性,模糊技术在图像应用中的实用性和广泛性,提出了一种基于三角隶属函数和模糊熵的新的图像增强算法(T-FE增强算法),使用三角函数作为隶属函数,重构参数型对比增强算子,运用模糊熵最大原则选取阈值,计算快速,简单.并且将T-FE算法运用于图像分割,边缘检测.通过实验仿真表明,T-FE算法在进行图像处理时有较好效果.     

Mixed fuzzy inter-cluster separation clustering algorithm

Based on inter-cluster separation clustering (ICSC) fuzzy inter-cluster separation clustering (FICSC) deals with all the distances between the cluster centers, maximizes these distances and obtains the better performances of clustering. However, FICSC is sensitive to noises the same as fuzzy c-means (FCM) clustering. Possibilistic type of FICSC is proposed to combine FICSC and possibilistic c-means (PCM) clustering. Mixed fuzzy inter-cluster separation clustering (MFICSC) is presented to extend possibilistic type of FICSC because possibilistic type of FICSC is sensitive to initial cluster centers and always generates coincident clusters. MFICSC can produce both fuzzy membership values and typicality values simultaneously. MFICSC shows good performances in dealing with noisy data and overcoming the problem of coincident clusters. The experimental results with data sets show that our proposed MFICSC holds better clustering accuracy, little clustering time and the exact cluster centers.     

A modified rough c-means clustering algorithm based on hybrid imbalanced measure of distance and density

Traditional c-means clustering partitions a group of objects into a number of non-overlapping sets. Rough sets provide more flexible and objective representation than classical sets with hard partition and fuzzy sets with subjective membership function for a given dataset. Rough c-means clustering and its extensions were introduced and successfully applied in many real life applications in recent years. Each cluster is represented by a reasonable pair of lower and upper approximations. However, the most available algorithms pay no attention to the influence of the imbalanced spatial distribution within a cluster. The limitation of the mean iterative calculation function, with the same weight for all the data objects in a lower or upper approximation, is analyzed. A hybrid imbalanced measure of distance and density for the rough c-means clustering is defined, and a modified rough c-means clustering algorithm is presented in this paper. To evaluate the proposed algorithm, it has been applied to several real world data sets from UCI. The validity of this algorithm is demonstrated by the results of comparative experiments.     

Fuzzy clustering using multiple Gaussian kernels with optimized-parameters

In this paper, we propose a new kernel-based fuzzy clustering algorithm which tries to find the best clustering results using optimal parameters of each kernel in each cluster. It is known that data with nonlinear relationships can be separated using one of the kernel-based fuzzy clustering methods. Two common fuzzy clustering approaches are: clustering with a single kernel and clustering with multiple kernels. While clustering with a single kernel doesn’t work well with “multiple-density” clusters, multiple kernel-based fuzzy clustering tries to find an optimal linear weighted combination of kernels with initial fixed (not necessarily the best) parameters. Our algorithm is an extension of the single kernel-based fuzzy c-means and the multiple kernel-based fuzzy clustering algorithms. In this algorithm, there is no need to give “good” parameters of each kernel and no need to give an initial “good” number of kernels. Every cluster will be characterized by a Gaussian kernel with optimal parameters. In order to show its effective clustering performance, we have compared it to other similar clustering algorithms using different databases and different clustering validity measures.