An adaptive dual clustering algorithm based on hierarchical structure: A case study of settlement zoning

Traditional dual clustering algorithms cannot adaptively perform clustering well without sufficient prior knowledge of the dataset. This article aims at accommodating both spatial and non‐spatial attributes in detecting clusters without the need to set parameters by default or prior knowledge. A novel adaptive dual clustering algorithm (ADC+) is proposed to obtain satisfactory clustering results considering the spatial proximity and attribute similarity with the presence of noise and barriers. In this algorithm, Delaunay triangulation is utilized to adaptively obtain spatial proximity and spatial homogenous patterns based on particle swarm optimization (PSO). Then, a hierarchical clustering method is employed to obtain clusters with similar attributes. The hierarchical clustering method adopts a discriminating coefficient to adaptively control the depth of the hierarchical architecture. The clustering results are further refined using an optimization approach. The advantages and practicability of the ADC+ algorithm are illustrated by experiments on both simulated datasets and real‐world applications. It is found that the proposed ADC+ algorithm can adaptively and accurately detect clusters with arbitrary shapes, similar attributes and densities under the consideration of barriers.     

DBSCAN空间聚类算法及其在城市规划中的应用

空间聚类是空间数据挖掘和知识发现的主要方法之一。DBSCAN算法可以从带有“噪声”的空间数据库中发现任意形状的聚类,是一种较好的聚类算法。本文介绍了DBSCAN算法的基本概念和原理,并应用GIS二次开发组件MapObjects予以了实现。然后,本文将该算法应用于城市规划中,对某城市中小学和商业网点等公共设施的分布进行了聚类分析,并根据聚类结果对城市规划设计规范中的某些条款进行了讨论。     

基于场论的空间聚类算法

从空间数据场的角度出发,提出了一种适用于空间聚类的场——凝聚场,并给出了一种新的空间聚类度量指标(即凝聚力)。进而,提出了一种基于场论的空间聚类算法(简称FTSC算法)。该算法根据凝聚力的矢量计算获取每个实体的邻近实体,通过递归搜索的策略,生成一系列不同的空间簇。通过模拟实验验证、经典算法比较和实际应用分析,发现所提出的算法具有3个方面的优势:(1)不需要用户输入参数;(2)能够发现任意形状的空间簇;(3)能够很好适应空间数据分布不均匀的特性。     

基于共享单车时空大数据的细粒度聚类

针对传统上单独采用K-means或DBSCAN等方法对共享单车位置数据聚类时造成的聚类结果与真实的聚类结构不符的问题,本文提出了一种基于共享单车时空大数据的细粒度聚类方法(FGCM)。该方法通过DBSCAN进行初始聚类,并在此基础上采用GMM-EM算法进行细部聚类,以提取细粒度层级的热点区域。试验表明,该方法可根据密度阈值排除噪声和离群值,无需指定细部聚类簇数,簇的形状和大小比较灵活。在对共享单车大数据位置特征进行聚类时,与传统的单独采用K-means或DBSCAN的方法相比,FGCM具备更高的精细程度,能够充分展现共享单车的实际聚集特征,可用于规划共享单车电子围栏等设施,在不降低通勤效率的基础上规范共享单车的停放问题。     

滚圆法用于空间点聚类的研究

空间点聚类依据空间点实体属性对其进行分类划分,挖掘对研究应用有价值的信息。目前,空间点聚类大多数方法能够发现多边形簇,但不能发现线状簇。针对空间点聚类现有方法在发现线状簇方面的不足,借鉴滚球法的思想,提出滚圆法用于空间点聚类的研究算法（spatial point clustering using the rolling circle,SPCURC）。针对研究区域的点实体,该算法用给定半径的圆从初始点开始按照原则进行滚动,直至满足条件为止;连接滚圆接触的点,从而形成多边形簇或者线状簇。通过模拟算例和实际算例验证了该算法的可行性。     

矢量居民地多边形多级图划分聚类方法

针对复杂居民地多边形的信息挖掘问题,提出了一种多级图划分聚类分析方法,构造居民地多边形的图模型,并通过对图模型进行粗化匹配与重构、初始化分和细化得到聚类结果.首先构建研究区域内居民地建筑物的Delaunay三角网,生成包含研究对象之间的邻接信息图;然后结合空间认知准则和人类认知的特点,采用形状狭长度、面积比、凹凸性、距...     

Polygonal Clustering Analysis Using Multilevel Graph‐Partition

Existing methods of spatial data clustering have focused on point data, whose similarity can be easily defined. Due to the complex shapes and alignments of polygons, the similarity between non‐overlapping polygons is important to cluster polygons. This study attempts to present an efficient method to discover clustering patterns of polygons by incorporating spatial cognition principles and multilevel graph partition. Based on spatial cognition on spatial similarity of polygons, four new similarity criteria (i.e. the distance, connectivity, size and shape) are developed to measure the similarity between polygons, and used to visually distinguish those polygons belonging to the same clusters from those to different clusters. The clustering method with multilevel graph‐partition first coarsens the graph of polygons at multiple levels, using the four defined similarities to find clusters with maximum similarity among polygons in the same clusters, then refines the obtained clusters by keeping minimum similarity between different clusters. The presented method is a general algorithm for discovering clustering patterns of polygons and can satisfy various demands by changing the weights of distance, connectivity, size and shape in spatial similarity. The presented method is tested by clustering residential areas and buildings, and the results demonstrate its usefulness and universality.     

基于改进的模糊c-均值聚类方法遥感影像分类研究(英文)

Classification is always the key point in the field of remote sensing. Fuzzy c-Means is a traditional clustering algorithm that has been widely used in fuzzy clustering. However, this algorithm usually has some weaknesses, such as the problems of falling into a local minimum, and it needs much time to accomplish the classification for a large number of data. In order to overcome these shortcomings and increase the classification accuracy, Gustafson-Kessel （GK） and Gath-Geva （GG） algorithms are proposed to improve the traditional FCM algorithm which adopts Euclidean distance norm in this paper. The experimental result shows that these two methods are able to detect clusters of varying shapes, sizes and densities which FCM cannot do. Moreover, they can improve the classification accuracy of remote sensing images.     

DBSCAN聚类和改进的双边滤波算法在点云去噪中的应用

采用基于密度的DBSCAN聚类算法对点云数据进行去噪处理，然后通过改进的双边滤波方法进行光顺处理实现点云平滑效果，最终的结果不仅有效去除了噪声点，还保留了点云模型的特征。以沈阳民国时期代表性的建筑——沈阳金融博物馆为试验模型进行试验，结果表明：通过DBSCAN聚类算法处理后得到的点云数据，再经改进的双边滤波处理所得到的数据远远比原点云数据直接运用改进的双边滤波处理得到的数据精度高，点云去噪效果更好。     

出租车轨迹数据的南京人群出行模式挖掘

针对现有出租车轨迹数据挖掘中时间序列邻近度量方法存在的问题,提出一种基于DBSCAN算法和改进的DTW距离的时间序列聚类算法提取具有相似性出行特征的时空模式,进而研究城市人群出行行为的时空差异。以南京市为例,结合电子地图对出行模式的空间分布特征进行分析,证明了本文所提出的方法的有效性。实验结果表明:在空间分布上,工作日出租车出行模式按照平均出行频次由高到低排序,从城市中心向四周扩散,呈中心环状分布,出行模式区域界限较为明显,同类出行模式分布区域对应相似的功能。提出了一种基于DBSCAN算法和改进的DTW距离的时间序列聚类算法提取具有相似性出行特征的时空模式,有效地分析城市人群出行行为的时空差异。     

利用浮动车GPS轨迹识别与提取城市道路交叉口

道路交叉口作为道路交汇的枢纽,是路网的重要组成部分,也是最重要的基础地理信息数据之一。浮动车GPS数据具有易获取、低成本和数据量大等优点,但工作同时伴随不少噪点。为了降低噪点对交叉口提取过程的影响,提高计算效率,本文运用KNN算法建立空间索引;计算向量夹角,判定道路出入口,粗筛取交叉口附近点;分别采用K-means算法、DBSCAN算法和层次算法进行聚类分析,进一步确定交叉口位置。最后以成都某区域浮动车GPS数据为例,提取道路交叉口并进行了对比分析,进一步表明本文方法可以服务于智能交通研究与应用。     

A novel method for discovering spatio-temporal clusters of different sizes,shapes, and densities in the presence of noise

The discovery of spatio-temporal clusters in complex spatio-temporal data-sets has been a challenging issue in the domain of spatio-temporal data mining and knowledge discovery. In this paper, a novel spatio-temporal clustering method based on spatio-temporal shared nearest neighbors (STSNN) is proposed to detect spatio-temporal clusters of different sizes, shapes, and densities in spatio-temporal databases with a large amount of noise. The concepts of windowed distance and shared nearest neighbor are utilized to define a novel spatio-temporal density for a spatio-temporal entity with definite mathematical meanings. Then, the density-based clustering strategy is employed to uncover spatio-temporal clusters. The spatio-temporal clustering algorithm developed in this paper is easily implemented and less sensitive to density variation among spatio-temporal entities. Experiments are undertaken on several simulated data-sets to demonstrate the effectiveness and advantage of the STSNN algorithm. Also, the real-world applications on two seismic databases show that the STSNN algorithm has the ability to uncover foreshocks and aftershocks effectively.     

一种基于双重距离的空间聚类方法

传统聚类方法大都是基于空间位置或非空间属性的相似性来进行聚类,分裂了空间要素固有的二重特性,从而导致了许多实际应用中空间聚类结果难以同时满足空间位置毗邻和非空间属性相近。然而,兼顾两者特性的空间聚类方法又存在算法复杂、结果不确定以及不易扩展等问题。为此,本文通过引入直接可达和相连概念,提出了一种基于双重距离的空间聚类方法,并给出了基于双重距离空间聚类的算法,分析了算法的复杂度。通过实验进一步验证了基于双重距离空间聚类算法不仅能发现任意形状的类簇,而且具有很好的抗噪性。     

Making direction a first‐class citizen of Tobler's first law of geography

Waldo Tobler frequently reminded us that the law named after him was nothing more than calling for exceptions. This article discusses one of these exceptions. Spatial relations between points are frequently modeled as vectors in which both distance and direction are of equal prominence. However, in Tobler's first law of geography, such a relation is described only from the perspective of distance by relating the decreasing similarity of observations in some attribute space to their increasing distance in geographic space. Although anisotropic versions of many geographic analysis techniques, such as directional semivariograms, anisotropy clustering, and anisotropic point pattern analysis, have been developed over the years, direction remains on the level of an afterthought. We argue that, compared to distance, directional information is still under‐explored and anisotropic techniques are substantially less frequently applied in everyday GIS analysis. Commonly, when classical spatial autocorrelation indicators, such as Moran's I, are used to understand a spatial pattern, the weight matrix is only built from distance, without direction being considered. Similarly, GIS operations, such as buffering, do not take direction into account either, with distance in all directions being treated equally. In reality, meanwhile, particularly in urban structures and when processes are driven by the underlying physical geography, direction plays an essential role. In this article we ask whether the development of early GIS, data (sample) sparsity, and Tobler's law lead to a theory‐induced blindness for the role of direction. If so, is it possible to envision direction becoming a first‐class citizen of equal importance to distance instead of being an afterthought only considered when the deviation from a perfect circle becomes too obvious to be ignored?     

基于融合和IFLICM算法的非监督遥感影像变化检测

提出了一种基于多尺度小波融合和改进的非监督模糊聚类的多光谱遥感影像变化检测方法。该算法解决了目前很多算法造成虚警率较高,而且未能充分利用像元之间空间关系的问题。首先利用二维离散小波（DWT）多尺度分解的方式来构造差异图,通过对两种小波分解系数融合的方式来抑制噪声点和突出变化区域。考虑到像元之间的空间位置信息,在融合后的基础上采用改进的模糊局部信息聚类（IFLICM）的方法得到变化检测结果。对两个时相的多光谱遥感卫星影像进行变化检测试验,试验表明基于融合的变化检测结果精度更高,并且改进后的聚类算法效果比其他聚类算法效果更好。     

顾及属性空间分布不均的空间聚类方法——以城市商业中心的提取为例

针对Delaunay三角网空间聚类存在的不足,提出一种顾及属性空间分布不均的空间聚类方法。首先将Delaunay三角网空间位置聚类作为约束条件,采用广度优先搜索方法,以局部参数"属性变化率"作为阈值识别非空间属性相似簇的聚类过程。以城市商业中心为例,验证了该方法能够更客观地识别非空间属性相似的簇,且自适应属性阈值可以满足不同聚类需求,为城市商业中心等空间实体的提取提供了一种有效方法。     

利用模糊密度聚类和双向缓冲区自动识别热点区

通过数据挖掘手段获取聚集模式（即热点）等地理空间知识是地理信息智能化服务的基础和前提。点群聚集模式的提取本质上是热点及其边界（热点区）的探测。首先分析了使用空间聚类提取热点并以凸壳表达热点轮廓的不足，进而提出一种利用模糊密度聚类和双向缓冲区的热点区自动识别方法。该方法借鉴模糊集理论，通过计算对象之间的模糊隶属度改进基于密度的聚类算法，用以提取点群的聚集模式；在此基础上，将模糊隶属度作为对象间的影响程度，采用正负缓冲区建立热点边界。以郑州市城区的科研机构点为例进行实验，结果表明，提出的方法既能有效区分空间点的类型（噪声点与非噪声点），又能生成连续平滑的热点边界，总体效果优于对比方法。     

GeoSurveillance: a GIS-based system for the detection and monitoring of spatial clusters

This article introduces a software package named GeoSurveillance that combines spatial statistical techniques and GIS routines to perform tests for the detection and monitoring of spatial clustering. GeoSurveillance provides both retrospective and prospective tests. While retrospective tests are applied to spatial data collected for a particular point in time, prospective tests attempt to incorporate the dynamic nature of spatial patterns via analyzing time-series data to detect emergent clusters as quickly as possible. This article will outline the structure of GeoSurveillance as well as describe the statistical cluster detection methods implemented in the software. It concludes with an illustration of the use of the software to analyze the spatial pattern of low birth weights in Los Angeles County, California.      

SE‐KGE: A location‐aware Knowledge Graph Embedding model for Geographic Question Answering and Spatial Semantic Lifting

Learning knowledge graph (KG) embeddings is an emerging technique for a variety of downstream tasks such as summarization, link prediction, information retrieval, and question answering. However, most existing KG embedding models neglect space and, therefore, do not perform well when applied to (geo)spatial data and tasks. Most models that do consider space primarily rely on some notions of distance. These models suffer from higher computational complexity during training while still losing information beyond the relative distance between entities. In this work, we propose a location‐aware KG embedding model called SE‐KGE. It directly encodes spatial information such as point coordinates or bounding boxes of geographic entities into the KG embedding space. The resulting model is capable of handling different types of spatial reasoning. We also construct a geographic knowledge graph as well as a set of geographic query–answer pairs called DBGeo to evaluate the performance of SE‐KGE in comparison to multiple baselines. Evaluation results show that SE‐KGE outperforms these baselines on the DBGeo data set for the geographic logic query answering task. This demonstrates the effectiveness of our spatially‐explicit model and the importance of considering the scale of different geographic entities. Finally, we introduce a novel downstream task called spatial semantic lifting which links an arbitrary location in the study area to entities in the KG via some relations. Evaluation on DBGeo shows that our model outperforms the baseline by a substantial margin.