9 January 2008 A MinMax spatial clustering algorithm under the complex geography environment
Author Affiliations +
Proceedings Volume 6794, ICMIT 2007: Mechatronics, MEMS, and Smart Materials; 679445 (2008) https://doi.org/10.1117/12.784036
Event: ICMIT 2007: Mechatronics, MEMS, and Smart Materials, 2007, Gifu, Japan
Abstract
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Maoyun Guo, Maoyun Guo, Zhifen Zhang, Zhifen Zhang, Youqiang Hu, Youqiang Hu, Jianfeng Qu, Jianfeng Qu, Yi Chai, Yi Chai, } "A MinMax spatial clustering algorithm under the complex geography environment", Proc. SPIE 6794, ICMIT 2007: Mechatronics, MEMS, and Smart Materials, 679445 (9 January 2008); doi: 10.1117/12.784036; https://doi.org/10.1117/12.784036
PROCEEDINGS
5 PAGES


SHARE
Back to Top