【24h】

Tobacco distribution based on improved K-means algorithm

机译:基于改进的K均值算法的烟草分布

获取原文

摘要

In order to solve the problem of distribution area segmentation of tobacco distribution, an improved k-means clustering algorithm was proposed in this paper. Firstly, the density of every node was calculated, and the first K nodes with the highest density were selected as initial clustering centers. Then the marginal nodes were prioritized to avoid the bad effect that marginal nodes might cause on clustering result. The experimental result demonstrated that the improved clustering algorithm not only avoided the local optima but also gave serious consideration to every important marginal node.
机译:为了解决烟草分布的分布区域分割问题,本文提出了一种改进的k均值聚类算法。首先,计算每个节点的密度,并且选择具有最高密度的第一k节点作为初始聚类中心。然后优先考虑边缘节点以避免边缘节点可能导致聚类结果的不良影响。实验结果表明,改进的聚类算法不仅避免了本地最佳算法,而且对每个重要的边缘节点进行了认真考虑。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号