检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:史彦丽[1] 金欢 SHI Yanli;JIN Huan(School of Science,Jilin Institute of Chemical Technology,Jilin 132022,China;School of Information and Control Engineering,Jilin Institute of Chemical Technology,Jilin 132022,China)
机构地区:[1]吉林化工学院理学院,吉林吉林132022 [2]吉林化工学院信息与控制工程学院,吉林吉林132022
出 处:《吉林化工学院学报》2022年第7期77-85,共9页Journal of Jilin Institute of Chemical Technology
摘 要:针对K均值聚类算法对类簇数目预先不可知及无法处理非凸形分布数据集的缺陷,提出基于进化思想的聚类算法及其类簇融合算法.该算法将K均值聚类算法嵌入进化聚类算法框架中,通过调整距离倍参,将数据逐渐划分,在此过程中自动确定类簇数目,提出基于最近距离的中间圆密度簇融合算法和基于代表类的中间圆密度簇融合算法,将相似度大的类簇进行融合,使得k值逐渐趋向真实值.实验表明,该方法具有良好的实用性.Aiming at the defects of K-means clustering algorithm that the number of clusters is unknown in advance and cannot deal with non-convex distributed data sets,a clustering algorithm based on evolutionary idea and its cluster fusion algorithm were proposed,The algorithm embeds the K-means clustering algorithm into the framework of evolutionary clustering algorithm.By adjusting the distance doubling parameter,the data objects will be divided gradually,and the number of clusters k will be determined adaptively,Then,a middle circle density cluster fusion algorithm based on the nearest distance and a middle circle density cluster fusion algorithm based on representative classes were proposed to fuse the clusters with high similarity,so that the k value gradually tends to the real value.Experiments showed that this method has good practice.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229