Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some ...Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.展开更多
The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection an...The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.展开更多
针对模糊C均值(Fuzzy C-Means,FCM)算法,不能有效地对夹杂噪声的遥感图像聚类的问题,本文提出了一种基于局部空间信息核模糊C均值(Kernel Fuzzy C-Means,KFCM)的遥感图像聚类算法。首先,运用核函数将遥感图像的所有像元映射到高维特征空...针对模糊C均值(Fuzzy C-Means,FCM)算法,不能有效地对夹杂噪声的遥感图像聚类的问题,本文提出了一种基于局部空间信息核模糊C均值(Kernel Fuzzy C-Means,KFCM)的遥感图像聚类算法。首先,运用核函数将遥感图像的所有像元映射到高维特征空间,通过非线性映射优化遥感图像的有用特征;然后,根据相邻像元之间的相关性,利用一种空间函数重新定义像元的模糊隶属度,将像元的局部空间信息引入到FCM算法中,并在高维特征空间中使用这种基于局部空间信息的FCM算法对像元聚类。由于引入了像元的局部空间信息,算法可以直接应用于原始遥感图像,不需要滤波预处理。大量实验结果表明,本文提出的基于局部空间信息KFCM的遥感图像聚类算法具有较强的抗噪能力,可得到较好的同质区域,优于现有的FCM算法、模糊局部信息C均值(Fuzzy Local Information C-Means,FLICM)算法及KFCM算法。展开更多
文摘Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.
基金supported by the Planning Special Project of Guangdong Power Grid Co.,Ltd.:“Study on load modeling based on total measurement and discrimination method suitable for system characteristic analysis and calculation during the implementation of target grid in Guangdong power grid”(0319002022030203JF00023).
文摘The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.
文摘针对模糊C均值(Fuzzy C-Means,FCM)算法,不能有效地对夹杂噪声的遥感图像聚类的问题,本文提出了一种基于局部空间信息核模糊C均值(Kernel Fuzzy C-Means,KFCM)的遥感图像聚类算法。首先,运用核函数将遥感图像的所有像元映射到高维特征空间,通过非线性映射优化遥感图像的有用特征;然后,根据相邻像元之间的相关性,利用一种空间函数重新定义像元的模糊隶属度,将像元的局部空间信息引入到FCM算法中,并在高维特征空间中使用这种基于局部空间信息的FCM算法对像元聚类。由于引入了像元的局部空间信息,算法可以直接应用于原始遥感图像,不需要滤波预处理。大量实验结果表明,本文提出的基于局部空间信息KFCM的遥感图像聚类算法具有较强的抗噪能力,可得到较好的同质区域,优于现有的FCM算法、模糊局部信息C均值(Fuzzy Local Information C-Means,FLICM)算法及KFCM算法。
文摘针对核模糊C-均值算法(kernel fuzzy C-means,KFCM)随机选择初始聚类中心而不能获得全局最优且在聚类中心较近或重合时易产生一致性聚类等问题,提出一种改进算法。改进算法在原目标函数中引入中心极大化约束项来调控簇间分离度,从而避免算法出现一致性聚类结果。利用磷虾群算法对基于新目标函数的KFCM算法进行优化,使算法不再依赖初始聚类中心,提高算法的稳定性。基于距离最大最小原则产生多组较优的聚类中心作为初始磷虾群体并在算法迭代过程中融合一种新的精英保留策略,从而确保算法收敛到全局极值;通过对个体随机扩散活动进行分段式Logistic混沌扰动,提高算法全局寻优能力。使用KDD Cup 99入侵检测数据进行仿真实验表明,改进算法具有更好的检测性能,解决了传统的聚类算法在入侵检测中稳定性差、检测准确率低的问题。
