首页> 外文会议>International Conference on Applications and Techniques in Cyber Intelligence >Improvement and Empirical Study of K-Means Clustering Algorithm Based on Chinese Retrieval
【24h】

Improvement and Empirical Study of K-Means Clustering Algorithm Based on Chinese Retrieval

机译:基于汉语检索的K均值聚类算法的改进与实证研究

获取原文

摘要

K-means is a classical clustering algorithm, which is a hard clustering algorithm. The algorithm has the advantages of simplicity and speed, especially when dealing with large data sets. It can be more efficient and flexible. However, the K-means algorithm also has some shortcomings and defects, such as relying on the initial clustering center to fall into the local optimal solution, easy to love noise points and isolated point effects. The article will optimize and demonstrate the shortcomings and defects of the K-means algorithm.
机译:K-means是一种经典聚类算法,它是一种硬群集算法。该算法具有简单性和速度的优点,特别是在处理大数据集时。它可以更有效灵活。然而,K-Means算法还具有一些缺点和缺陷,例如依靠初始聚类中心落入本地最佳解决方案,易于爱噪声点和孤立的点效应。本文将优化和展示K-Means算法的缺点和缺陷。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号