检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:鲍舒婷 孙丽萍 郑孝遥[1,2] 郭良敏 BAO Shuting 1,2 , SUN Liping 1,2 ,ZHENG Xiaoyao 1,2 ,GUO Liangmin 1,2(1. School of Computer and Information, Anhui Normal University, Wuhu Anhui 241002, China;2. Anhui Provincial Key Laboratory of Network and Information Security ( Anhui Normal University ) , Wuhu Anhui 241002, China)
机构地区:[1]安徽师范大学计算机与信息学院,安徽芜湖241002 [2]网络与信息安全安徽省重点实验室(安徽师范大学),安徽芜湖241002
出 处:《计算机应用》2018年第6期1601-1607,共7页journal of Computer Applications
基 金:国家自然科学基金资助项目(61602009;61772034);安徽省自然科学基金资助项目(1608085MF145;1508085QF133)~~
摘 要:密度峰聚类是一种基于密度的高效聚类方法,但存在对全局参数dc敏感和需要人工干预决策图进行聚类中心选择的缺陷。针对上述问题,提出了一种基于共享近邻相似度的密度峰聚类算法。首先,该算法结合欧氏距离和共享近邻相似度进行样本局部密度的定义,避免了原始密度峰聚类算法中参数dc的设置;其次,优化聚类中心的选择过程,能够自适应地进行聚类中心的选择;最后,将样本分配至距其最近并拥有较高密度的样本所在的簇中。实验结果表明,在UCI数据集和模拟数据集上,该算法与原始的密度峰聚类算法相比,准确率、标准化互信息(NMI)和F-Measure指标分别平均提高约22.3%、35.7%和16.6%。该算法能有效地提高聚类的准确性和聚类结果的质量。Density peaks clustering is an efficient density-based clustering algorithm. However, it is sensitive to the global parameter dc. Furthermore, artificial intervention is needed for decision graph to select clustering centers. To solve these problems, a new density peaks clustering algorithm based on shared near neighbors similarity was proposed. Firstly, the Euclidean distance and shared near neighbors similarity were combined to define the local density of a sample, which avoided the setting of parameter dcof the original density peaks clustering algorithm. Secondly, the selection process of clustering centers was optimized to select initial clustering centers adaptively. Finally, each sample was assigned to the cluster as its nearest neighbor with higher density samples. The experimental results show that, compared with the original density peaks clustering algorithm on the UCI datasets and the artificial datasets, the average values of accuracy, Normalized Mutual Information(NMI) and F-Measure of the proposed algorithm are respectively increased by about 22. 3%, 35. 7% and16. 6%. The proposed algorithm can effectively improve the accuracy of clustering and the quality of clustering results.
关 键 词:密度峰聚类 K近邻 共享近邻 局部密度 相似性度量
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30