检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘沧生[1] 许青林[1] LIU Cangsheng;XU Qinglin(College of Computer Science,Guangdong University of Technology,Guangzhou 510006,China)
出 处:《计算机工程与应用》2018年第14期153-157,共5页Computer Engineering and Applications
基 金:广东省科技厅重大专项(No.2016B030305002;No.2016B030306003)
摘 要:针对传统模糊C均值聚类算法和基于K-means++优化聚类中心的模糊C均值算法存在初始聚类中心敏感、聚类速度收敛慢、聚类算法需要人为给定聚类数目等缺陷,受密度峰值聚类算法(Clustering by Fast Search and Find of Density Peaks,CFSFDP)的启发,提出了基于密度峰值算法优化的模糊C均值聚类算法,自适应产生初始聚类中心,确定聚类数目,并优化算法收敛过程。实验结果表明,改进后的算法与传统模糊聚类C均值算法相比能够准确地得到簇的数目,性能有明显的提高,并加快算法的收敛速度,达到相对更好的聚类效果。Aiming at the traditional fuzzy C-means clustering algorithm and the fuzzy C-means algorithm based on Kmeans++ optimization clustering center, with the defects that initial clustering center sensitivity, clustering speed convergence is slow, the clustering algorithm needs to be given the number of artificial clustering, inspired by CFSFDP, a fuzzy C-means clustering algorithm based on density peak algorithm optimization is proposed. Adaptive clustering algorithm is generated to determine the number of clusters and to optimize the number of clusters. The clustering algorithm is based on the fast clustering algorithm(CFSFDP)convergence process. The experimental results show that the improved algorithm can accurately obtain the number of clusters and improve the performance compared with the traditional fuzzy clustering C-means algorithm, and accelerate the convergence speed of the algorithm to achieve a relatively better clustering effect.
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175