An improved PAM algorithm for optimizing initial cluster center

机译：用于优化初始聚类中心的改进PAM算法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

To solve the inefficiency problem of traditional PAM algorithm for initial cluster center, a new improved PAM algorithm is proposed. The algorithm builds minimum spanning tree and then splits it to get k initial clusters with the relevant cluster centers. Theory analysis and experimental results show that the found initial centers are closed to the desired cluster centers, and the improved algorithm can achieve stable clustering results and higher cluster clustering accuracy.

机译：为解决传统PAM算法对初始聚类中心的低效率问题，提出了一种新的改进的PAM算法。该算法构建最小生成树，然后将其拆分为具有相关聚类中心的k个初始聚类。理论分析和实验结果表明，所发现的初始中心与期望的聚类中心接近，改进后的算法可以获得稳定的聚类结果和较高的聚类精度。

著录项

来源
《2012 IEEE 3rd International Conference on Software Engineering and Service Science》|2012年|p.24- 27|共4页
会议地点 Beijing(CN)
作者
Feng Bo; Hao Wenning; Chen Gang; Jin Dawei; Zhao Shuining;
展开▼
作者单位

Engineering Institute of Corps of Engineers, PLA University of Science Technology, Nanjing China;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类软件工程;
关键词

相似文献

外文文献
中文文献
专利

1. An Improved K-Means Algorithm Based on Initial Clustering Center Optimization [J] . LI Taihao, NAREN Tuya, ZHOU Jianshe, 中兴通讯技术（英文版） . 2017,第0z2期

机译：基于初始聚类中心优化的改进的K均值算法
2. A GENETIC ALGORITHM FOR OPTIMIZED INITIAL CENTERS K-MEANS CLUSTERING IN SMEs [J] . BAIN KHUSUL KHOTIMAH, FIRLI IRHAMNI, TRI SUNDARWATI Journal of Theoretical and Applied Information Technology . 2016,第1期

机译：中小企业初始中心K-均值聚类的遗传算法
3. A Genetic K-means Clustering Algorithm Based on the Optimized Initial Centers [J] . Min Feng, Zhenyan Wang Computer and information science . 2011,第3期

机译：基于最优初始中心的遗传K均值聚类算法
4. An improved PAM clustering algorithm based on initial clustering centers [C] . Lisheng Zhang, Meijie Yang, Dajiang Lei WASE Global Conference on Science Engineering . 2012

机译：基于初始聚类中心的改进的PAM聚类算法
5. K-centers dynamic clustering algorithms and applications. [D] . Xie, Qing Yan. 2013

机译：K中心动态聚类算法和应用程序。
6. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm Minimum Spanning Tree and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法最小生成树和分层聚类的三种混合方法的比较
7. Improved K-means Algorithm Based on Optimizing Initial Cluster Centers and Its Application [O] . Xue Linyao, Wang Jianguo 2018

机译：基于优化初始集群中心及其应用的改进的K均值算法
8. Use Beam Steering Dipoles to Minimize Aberrations Associated with Off-Centered Transit through the Induction Bunching Module. Design an Improved NDCX-I drift Compression Section to Make Best Use of the New Bunching Module to Optimize Planned Initial NDCX-I Target Experiments [R] . Seidl, P., Barnard, J., Lund, S., 2008

机译：使用光束转向偶极子通过感应聚束模块最大限度地减少与偏心传输相关的像差。设计改进的NDCX-I漂移压缩部分以充分利用新的聚束模块来优化计划的初始NDCX-I目标实验

An improved PAM algorithm for optimizing initial cluster center

摘要

著录项

相似文献

相关主题

期刊订阅