Graph distance and feature-guided multi-view clustering: A novel method for clustering urban buildings

Urban buildings are an integral component of urban space, and accurately identifying their spatial configurations and grouping them is vital for various urban applications. However, most existing building clustering methods only utilize the original spatial and nonspatial features of buildings, disregarding the potential value of complementary information from multiple perspectives. This limitation hinders their effectiveness in scenarios with intricate spatial configurations. To address this, this article proposes a novel multi-view building clustering method that captures cross-view information from spatial and nonspatial features. Drawing inspiration from both spatial proximity characteristics and nonspatial attributes, three views are established, including two spatial distance graphs (centroid distance graph and the nearest outlier distance graph) and a building attribute graph (multiple-attribute graph). The three graphs undergo iterative cross-diffusion processes to amplify similarities within each predefined graph view, culminating in their fusion into a unified graph. This fusion facilitates the comprehensive correlation and mutual enhancement of spatial and nonspatial information. Experiments were conducted using 10 real-world community-building datasets from Wuhan and Chengdu, China. The results demonstrate that our approach achieves 21.27% higher accuracy and 22.28% higher adjusted rand index in recognizing diverse complex arrangements compared to existing methods. These findings highlight the importance of leveraging complementary and consensus information across different feature dimensions for improving the performance of building clustering.     

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.     

一种顾及邻近域内实体间距离的空间异常检测新方法

空间异常检测已成为空间数据挖掘和知识发现的一个重要研究内容.空间异常蕴含着许多意想不到的知识,现有的空间异常检测方法大多依据空间邻近域的非空间属性差异来计算偏离因子,忽略了邻近域内空间实体间距离的影响.本文首先讨论了空间邻近域内实体间距离对空间异常检测的影响,在此基础上,提出了一种顾及邻近域内实体间距离的空间异常度量方法--SOM法,并分析了它的复杂度.由于该方法是利用实体非空间属性的加权内插值与实测值的差值作为度量空间异常程度的参数,从而顾及了邻近域内所有实体相互间距离对非空间属性偏离的影响,并且克服了现有检测方法在不均匀分布空间实体集内寻找空间异常的缺陷.最后,通过一个实际算例验证了所提方法的可行性和正确性.     

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

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

显著性权重RX高光谱异常点检测

高光谱图像异常点检测中,传统RX异常点检测算法忽略了空间相关性,背景估计不准确。本文提出了一种基于图像局部邻域光谱显著性分析的加权RX算法。该算法通过引入图像显著性分析,对基于概率密度为权重的图像背景建模进行改进,建立光谱显著性权重图,重新定义RX算法中的均值向量和协方差矩阵,并给不同的目标赋予不同的权值,达到优化背景估计的目的。利用合成高光谱数据和真实高光谱数据进行异常点检测实验,结果表明,对于同一组数据,本文算法检测到的异常点数比传统算法多,虚警率较低,有效地提高了检测率。     

利用GIS技术在东兰辛市建造一个停车场

Geographic information Systems （GiS） is being widely applied to official construction activities nowadays. This technique can not only display graphs for each spatial data displayed, but also provide a broad prediction and decision tool. The purpose of this paper is to describe the capabilities of GIS application in building a new parking facility in the city of East Lansing through wide analysis of the surrounding data. The results are displayed in maps and graphs. Finally, the recommendation area is selected using three criteria： proximity to the downtown area; the degree of VACANT; and distance from all buffers.     

A spatially explicit reinforcement learning model for geographic knowledge graph summarization

Web‐scale knowledge graphs such as the global Linked Data cloud consist of billions of individual statements about millions of entities. In recent years, this has fueled the interest in knowledge graph summarization techniques that compute representative subgraphs for a given collection of nodes. In addition, many of the most densely connected entities in knowledge graphs are places and regions, often characterized by thousands of incoming and outgoing relationships to other places, actors, events, and objects. In this article, we propose a novel summarization method that incorporates spatially explicit components into a reinforcement learning framework in order to help summarize geographic knowledge graphs, a topic that has not been considered in previous work. Our model considers the intrinsic graph structure as well as the extrinsic information to gain a more comprehensive and holistic view of the summarization task. By collecting a standard data set and evaluating our proposed models, we demonstrate that the spatially explicit model yields better results than non‐spatial models, thereby demonstrating that spatial is indeed special as far as summarization is concerned.     

一种基于场论的空间异常探测方法

从空间数据场的角度,借鉴高斯势函数发展了一种新的空间异常度度量指标。进而,提出了一种基于场论的空间异常探测方法。该方法通过空间聚类获得局部相关性较强的空间簇,并构建合理、稳定的空间邻近域。在此基础上,采用专题属性变化梯度修复策略减弱空间邻近域中潜在异常的影响,并利用空间异常度度量指标计算实体的异常度,从而探测空间异常。实验结果及实例证明了此方法的正确性。     

Multi‐scale approach to mining significant spatial co‐location patterns

Spatial co‐location pattern mining aims to discover a collection of Boolean spatial features, which are frequently located in close geographic proximity to each other. Existing methods for identifying spatial co‐location patterns usually require users to specify two thresholds, i.e. the prevalence threshold for measuring the prevalence of candidate co‐location patterns and distance threshold to search the spatial co‐location patterns. However, these two thresholds are difficult to determine in practice, and improper thresholds may lead to the misidentification of useful patterns and the incorrect reporting of meaningless patterns. The multi‐scale approach proposed in this study overcomes this limitation. Initially, the prevalence of candidate co‐location patterns is measured statistically by using a significance test, and a non‐parametric model is developed to construct the null distribution of features with the consideration of spatial auto‐correlation. Next, the spatial co‐location patterns are explored at multi‐scales instead of single scale (or distance threshold) discovery. The validity of the co‐location patterns is evaluated based on the concept of lifetime. Experiments on both synthetic and ecological datasets show that spatial co‐location patterns are discovered correctly and completely by using the proposed method; on the other hand, the subjectivity in discovery of spatial co‐location patterns is reduced significantly.     

利用航空重力梯度反演Kauring试验场三维密度结构

相对于传统的重力测量手段,重力梯度测量能够以更高的灵敏度和分辨能力反映出地下密度异常体的结构特征。由于拉格朗日经验参数在实测数据反演中存在不确定性,对预条件共轭梯度反演算法加以改进,利用L曲线的拐点值代替原反演算法中的拉格朗日经验参数作为正则化参数;为改善反演中存在的病态性问题并减弱核函数的快速衰减,将地下模型改进为不等间隔模型;为改善反演中解的非唯一性,利用重力梯度的5个独立分量进行联合反演;通过对澳大利亚Kauring试验场航空重力梯度张量进行联合反演,得到该地区异常体的三维密度分布,将重力梯度联合反演结果与之前的重力反演结果对比分析,发现在中心异常体附近沿线还分布着多个异常块体。结果表明,改进后的算法能够有效地利用实测重力梯度数据反演出密度异常体的分布信息。     

复杂背景下的仿蝇视觉遥感异常检测

本文针对遥感影像复杂背景下,背景地物光谱特征与目标光谱特征之间存在较强相关性的问题,提出一种基于仿蝇视觉的复杂背景下遥感异常检测算法。首先构建并行多孔径背景模型,实现对复杂背景特征的自适应描述;然后基于异常目标的光谱特征相对异常性,采用相对马氏距离区分异常区域、不确定区域与无目标区域,消除背景与目标光谱相关性对检测结果干扰的同时,弥补了传统假设检验无法区分无目标和不确定问题的不足;最后融合多个背景模型的检测结果,实现异常目标检测。仿真实验将围绕多种背景地物并存复杂区域的异常检测验证本文算法的有效性。     

顾及方向关系的农村居民地聚类方法

农村居民地空间分布具有独特的规律性和复杂性,Voronoi图在表达居民地分布特征方面有显著优势。针对当前空间聚类较少考虑实体方向关系的问题,基于Voronoi图提出一种顾及方向关系的农村居民地聚类方法。首先,构建距离约束的Voronoi图,并构建居民地实体间的Voronoi邻近图;然后,利用无向特征与有向特征来综合评价居民地实体间的聚集强度;最后,消除聚集强度小于阈值的实体对的邻近关系,得到聚类结果。采用浙江省宁波地区部分农村居民地数据进行实验,结果表明,所提方法能够有效聚类不同分布模式的居民地,聚类结果符合人的认知习惯。     

The computation of aliasing effects in local gravity field approximation

The aliasing effects in local gravity field computations are presented in this study. First the relation between the power spectral density of a 2-D continuous signal and its corresponding sampled version is derived. Then the power spectral density of the aliasing errors related to non band-limited signals is derived. Finally the variance of these aliasing errors is computed using gravity anomalies at different grid spacings. This computation prerequires some known gravity anomaly power spectral density model. The model used in this study corresponds to a second-order Gauss-Markov covariance function for the anomalous potential. Editor’s notice: Comments on this paper will follow in the next issue of Bulletin Géodésique.     

一种基于场论的层次空间聚类算法

从空间数据场的角度出发,提出了一种基于场论的层次空间聚类算法(简称HSCBFT)。该算法是通过模拟空间实体间的凝聚力来描述空间实体间的相互作用,进而采取层次凝聚的策略进行聚类。通过实验分析可以发现,层次空间聚类算法具有如下优势:①空间聚类簇中各空间实体很好地满足了空间邻近且专题属性相似的要求;②能发现任意形状的空间簇,且具有良好的抗噪性;③输入参数较少。     

A Multiscale Approach for Spatio-Temporal Outlier Detection

A spatial outlier is a spatially referenced object whose thematic attribute values are significantly different from those of other spatially referenced objects in its spatial neighborhood. It represents an object that is significantly different from its neighbourhoods even though it may not be significantly different from the entire population. Here we extend this concept to the spatio‐temporal domain and define a spatial‐temporal outlier (ST‐outlier) to be a spatial‐temporal object whose thematic attribute values are significantly different from those of other spatially and temporally referenced objects in its spatial or/and temporal neighbourhoods. Identification of ST‐outliers can lead to the discovery of unexpected, interesting, and implicit knowledge, such as local instability or deformation. Many methods have been recently proposed to detect spatial outliers, but how to detect the temporal outliers or spatial‐temporal outliers has been seldom discussed. In this paper we propose a multiscale approach to detect ST‐outliers by evaluating the change between consecutive spatial and temporal scales. A four‐step procedure consisting of classification, aggregation, comparison and verification is put forward to address the semantic and dynamic properties of geographic phenomena for ST‐outlier detection. The effectiveness of the approach is illustrated by a practical coastal geomorphic study.     

A points of interest matching method using a multivariate weighting function with gradient descent optimization

Volunteered geographic information contains abundant valuable data, which can be applied to various spatiotemporal geographical analyses. While the useful information may be distributed in different, low‐quality data sources, this issue can be solved by data integration. Generally, the primary task of integration is data matching. Unfortunately, due to the complexity and irregularities of multi‐source data, existing studies have found it difficult to efficiently establish the correspondence between different sources. Therefore, we present a multi‐stage method to match multi‐source data using points of interest. A spatial filter is constructed to obtain candidate sets for geographical entities. The weights of non‐spatial characteristics are examined by a machine learning‐related algorithm with artificially labeled random samples. A case study on Fuzhou reveals that an average of 95% of instances are accurately matched. Thus, our study provides a novel solution for researchers who are engaged in data mining and related work to accurately match multi‐source data via knowledge obtained by the idea and methods of machine learning.     

矿区开采沉陷3维可视化研究

矿区开采沉陷实体在移动过程中,具有明显的3维空间特征。目前,对于开采沉陷空间信息描述以2维的剖面线、曲线或等值线居多,而2维图形对于开采沉陷实体移动变形的表达缺乏直观性和准确性。而通过研究开采沉陷实体的空间特征并采用相应的数据模型,可实现开采沉陷3维可视化表达。这将有助于更加直观、深入地研究岩层移动形式、地表塌陷和地物损害程度,同时,对于研究、理解开采沉陷规律和提高开采沉陷损害防治技术也将很有意义。     

基于场论的空间聚类算法

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

基于正对投影距离的双线道路提取方法

大比例尺地图中双线道路的识别与提取是路网综合的重要组成部分。针对双线道路识别问题,根据双线道路的结构特点,结合国内外研究提出了一种可用于提取双线道路的距离度量方法——正对投影距离。首先通过缓冲区分析构建可能构成双线道路的候选线对集,然后利用正对投影距离构造约束参数从线对候选集中精确识别出双线道路线对。通过与其他距离度量方法的对比试验,表明正对投影距离能较准确表达双线道路线对的空间邻近性,可以准确识别出双线道路,符合人类空间认知特点。