CAJ | 학술논문

现实世界当中的各种约束条件限制了空间聚类必须考虑这些限制条件的存在.主要研究带障碍物的空间聚类,采用K-中心点算法进行聚类分析,在解决空间对象绕过障碍物的最短距离时引进改进的郭涛算法进行求解,对于中小规模数据体现了较高的执行效率.通过理论分析和实验验证,该算法是可行的.
현실세계당중적각충약속조건한제료공간취류필수고필저사한제조건적존재.주요연구대장애물적공간취류,채용K-중심점산법진행취류분석,재해결공간대상요과장애물적최단거리시인진개진적곽도산법진행구해,대우중소규모수거체현료교고적집행효솔.통과이론분석화실험험증,해산법시가행적.
In the real-world,constraints limits the spatial clustering must take into account the conditions of these restrictions, this paper studied the spatial clustering with obstacles.It mainly used the K-medoid algorithm to cluster,and it introduced an improved algorithm Guo Tao to solve the distance of spatial objects in the presence of obstacles.It is higher efficiency for small and medium-sized data.Through theoretical analysis and experimental, the algorithm is feasible.