首页> 外文会议>International Conference on Mechatronics and Information Technology >A MinMax spatial clustering algorithm under the complex geography environment
【24h】

A MinMax spatial clustering algorithm under the complex geography environment

机译:复杂地理环境下的MinMax空间聚类算法

获取原文

摘要

The spatial clustering analysis of geographic entities under the complex geography environment is significant, such as nature resources analyzing, the public facilities location, the districts adjustment and epidemic prevention. The clustering center which is got from the clustering analyzing can be choice for the public facilities such as schools, hospitals and so on. And also such center can be the source of the epidemic, which supports to prevent the epidemic. The MinMax clustering algorithm based on the euclidian distance. But under complex geography environment such including rivers, mountains and so on, the euclidian distance can not reflect the relationship between one entities and the other. So with the analysis of the influence of road, river and the mountains to distance between the entities, the paper introduces the factors that reflects the geography environment, and improves the MinMax clustering algorithm. And the paper carries out a clustering experiment whose result shows that the improved MinMax clustering algorithm is better than the basic one.
机译:复杂地理环境下地理实体的空间聚类分析是显着的,如自然资源分析,公共设施位置,地区调整和防疫。来自聚类分析的聚类中心可以选择学校,医院等公共设施。此外的中心也可以是流行病的来源,支持防止疫情。基于欧几里德距离的Minmax聚类算法。但在包括河流,山等内的复杂地理环境下,欧几里德距离无法反映一个实体与另一个实体之间的关系。因此,随着道路,河流和山脉的影响到实体之间的距离,介绍了反映地理环境的因素,提高了MinMax聚类算法。纸张执行群集实验,其结果表明改进的MinMax聚类算法优于基本一个。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号