首页> 外文会议>International Workshop on Education Technology and Computer Science >A Novel Spatial Clustering Algorithm Based on Spatial Adjacent Relation for GML Data
【24h】

A Novel Spatial Clustering Algorithm Based on Spatial Adjacent Relation for GML Data

机译:一种基于GML数据的空间相邻关系的新型空间聚类算法

获取原文

摘要

With the development of WEBGIS, GML is becoming a common way of storing spatial data. GML is an application of XML in geographic information system. In this paper, a novel algorithm SCAR-GML is proposed for spatial clustering in GML data. Compared with other spatial clustering algorithms, SCAR-GML clusters spatial objects based on the spatial adjacent relations, while the reported algorithms like DBSCAN just cluster the spatial objects that are near to each other into a cluster. SCAR-GML firstly computes the spatial adjacent relations and then clusters the objects according to the computed relations. The objects in one cluster may not be near to each other, but they have similarity in the spatial adjacent relations. Encouraging simulation results are observed and reported. The experiment shows that SCAR-GML is effective and efficient.
机译:随着WebGIS的开发,GML正在成为存储空间数据的常见方式。 GML是地理信息系统中XML的应用。本文提出了一种新颖的算法SCAR-GML,用于GML数据中的空间聚类。与其他空间聚类算法相比,基于空间相邻关系的Scar-GML群空间对象,而DBSCAN则报告的算法仅群体群体彼此纳入群集。 Scar-GML首先计算空间相邻关系,然后根据计算的关系群体群集对象。一个簇中的对象可能不靠近彼此,但它们在空间相邻关系中具有相似性。令人欣赏和报道令人振奋的模拟结果。实验表明,Scar-GML是有效和有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号