首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种顾及障碍约束的空间聚类方法
引用本文:石岩,刘启亮,邓敏,王佳璆.一种顾及障碍约束的空间聚类方法[J].武汉大学学报(信息科学版),2012,37(1):96-100.
作者姓名:石岩  刘启亮  邓敏  王佳璆
作者单位:中南大学测绘与国土信息工程系,长沙市麓山南路,410083
基金项目:国家863计划资助项目,地理空间信息工程国家测绘局重点实验室开放研究基金资助项目,中南大学前沿研究计划资助项目
摘    要:为了使得空间聚类分析更加适应实际情况,发展了一种同时顾及空间障碍约束与空间位置邻近的空间聚类方法。该方法采用Delaunay三角网描述实体间的邻近关系,并且不依赖用户指定参数。实验验证了本方法的有效性与优越性。

关 键 词:空间聚类  空间障碍  Delaunay三角网  空间数据挖掘

A Novel Spatial Clustering Method with Spatial Obstacles
SHI Yan,LIU Qiliang,DENG Min,WANG Jia.A Novel Spatial Clustering Method with Spatial Obstacles[J].Geomatics and Information Science of Wuhan University,2012,37(1):96-100.
Authors:SHI Yan  LIU Qiliang  DENG Min  WANG Jia
Institution:1(1 Department of Surveying and Geo-informatics,Central South University,South Lushan Road,Changsha 410083,China)
Abstract:Spatial clustering has been a major research field in spatial data mining;it aims to discover some useful patterns or outliers in a spatial database.In practice,spatial obstacles,as river or mountains should be fully considered in the process of spatial clustering.On that account,a novel spatial clustering method considering spatial obstacles is proposed in this paper.Delaunay triangulation is employed to model spatial proximate relations among entities,and the method can automatically discover clusters with complex structures without user-specified parameters.Experiments on both simulated database and real-world database are utilized to demonstrate the effectiveness and advantage of our method.
Keywords:spatial clustering  spatial obstacle  Delaunay triangulation  spatial data mining
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号