###
DOI:
计算机系统应用英文版:2015,24(1):9-13
本文二维码信息
码上扫一扫!
基于障碍约束的空间聚类算法综述
(陕西理工学院 数学与计算机科学学院, 汉中 723000)
Survey of Spatial Clustering Algorithm with Obstacle Constrains
(School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723000, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1754次   下载 4710
Received:April 20, 2014    Revised:May 12, 2014
中文摘要: 传统的空间聚类算法解决的是未带障碍约束的空间数据聚类问题, 而现实的地理空间中经常会存在河流、山脉等阻碍物, 因此, 传统空间聚类算法不适用于带障碍数据约束的现实空间.在解析了带障碍空间聚类相关概念和定义的前提下, 对带障碍约束条件的空间聚类算法进行梳理, 给出了这类算法的研究历史和沿袭关系, 并把这类算法按七个维度分为四大类, 分析了每类的技术优缺点, 最后给出了带障碍约束的空间聚类算法的未来研究趋向.
Abstract:Classical algorithms of spatial clustering are performed in optimal data space without any obstacle. But many obstacle constrains exist in the real-world, such as rivers, mountains, etc. They may affect results of clustering substantially. In this paper, the knowledge of spatial clustering algorithm with obstacle constrains is illustrated in brief. And then, research history and inheritance relation of the algorithms is given. These algorithms are divided into four categories from seven respects. At last, technical feature of every category and trend of spatial clustering algorithm in the presence of obstacles are analyzed.
文章编号:     中图分类号:    文献标志码:
基金项目:陕西省教育厅科学研究计划(自然科学专项) (14JK1132);陕西省科学技术研究发展计划(2014KJXX-75);汉中市科技发展专项(2013hzzx-38)
引用文本:
余冬梅.基于障碍约束的空间聚类算法综述.计算机系统应用,2015,24(1):9-13
YU Dong-Mei.Survey of Spatial Clustering Algorithm with Obstacle Constrains.COMPUTER SYSTEMS APPLICATIONS,2015,24(1):9-13