A Hybrid Geocoding Methodology for Spatio‐Temporal Data

As tools for collecting data continue to evolve and improve, the information available for research is expanding rapidly. Increasingly, this information is of a spatio‐temporal nature, which enables tracking of phenomena through both space and time. Despite the increasing availability of spatio‐temporal data, however, the methods for processing and analyzing these data are lacking. Existing geocoding techniques are no exception. Geocoding enables the geographic location of people and events to be known and tracked. However, geocoded information is highly generalized and subject to various interpolation errors. In addition, geocoding for spatio‐temporal data is especially challenging because of the inherent dynamism of associated data. This article presents a methodology for geocoding spatio‐temporal data in ArcGIS that utilizes several additional supporting procedures to enhance spatial accuracy, including the use of supplementary land use information, aerial photographs and local knowledge. This hybrid methodology allows for the tracking of phenomenon through space and over time. It is also able to account for reporting inconsistencies, which is a common feature of spatio‐temporal data. The utility of this methodology is demonstrated using an application to spatio‐temporal address records for a highly mobile group of convicted felons in Hamilton County, Ohio.     

Improving Geocoding Match Rates with Spatially‐Varying Block Metrics

Address ranges used in linear interpolation geocoding often have errors and omissions that result in input address numbers falling outside of known address ranges. Geocoding systems may match these input addresses to the closest available nearby address range and assign low confidence values (match scores) to increase match rates, but little is published describing the matching or scoring techniques used in these systems. This article sheds light on these practices by investigating the need for, technical approaches to, and utility of nearby matching methods used to increase match rates in geocode data. The scope of the problem is motivated by an analysis of a commonly used health dataset. The technical approach of a geocoding system that includes a nearby matching approach is described along with a method for scoring candidates based on spatially‐varying neighborhoods. This method, termed dynamic nearby reference feature scoring, identifies, scores, ranks, and returns the most probable candidate to which the input address feature belongs or is spatially near. This approach is evaluated against commercial systems to assess its effectiveness and resulting spatial accuracy. Results indicate this approach is viable for improving match rates while maintaining acceptable levels of spatial accuracy.     

Street‐level Spatial Interpolation Using Network‐based IDW and Ordinary Kriging

This study proposes network‐based spatial interpolation methods to help predict unknown spatial values along networks more accurately. It expands on two of the commonly used spatial interpolation methods, IDW (inverse distance weighting) and OK (ordinary kriging), and applies them to analyze spatial data observed on a network. The study first provides the methodological framework, and it then examines the validity of the proposed methods by cross‐validating elevations from two contrasting patterns of street network and comparing the MSEs (Mean Squared Errors) of the predicted values measured with the two proposed network‐based methods and their conventional counterparts. The study suggests that both network‐based IDW and network‐based OK are generally more accurate than their existing counterparts, with network‐based OK constantly outperforming the other methods. The network‐based methods also turn out to be more sensitive to the edge effect, and their performance improves after edge correction. Furthermore, the MSEs of standard OK and network‐based OK improve as more sample locations are used, whereas those of standard IDW and network‐based IDW remain stable regardless of the number of sample locations. The two network‐based methods use a similar set of sample locations, and their performance is inherently affected by the difference in their weight distribution among sample locations.     

基于偏移四叉树投票的“大尺寸”点状符号多尺度无压盖可视化

为解决Web 2.0环境下点状符号地图混搭中的制图问题,本文研究并实现了一种可100%避免压盖的"大尺寸"点符号高效可视化方法。该方法的核心思想是四叉树网格单选,采用网格平移对多次单选结果投票来计算符号在各缩放级别的显著性等级,可解决符号在相邻网格的空间冲突。该过程不需要显式探测冲突,因而处理效率极高。随着地图放大,重要性较低的符号也逐级显现,实现了语义层次的多尺度表达。针对符号和网格大小比率关系、有效网格平移方案及图面利用率不足问题提出两种扩展:格网增选和多级符号叠加。对方法的可行性进行了试验验证,并分析了该方法在用户查询条件改变下的稳定性和不同数据量下的伸缩性(非优化实现可达到105量级数据的亚秒级处理)。     

大、中比例尺地形图上海岸的制图表示

本文着重讨论了大、中比例尺地形图上海岸如何表示的问题,在此基础上,论述了海岸的分类、各类海岸的表象、典型特征以及在制图综合时如何显示这些特点。最后,提出了海岸制图表示的一般原则。     

Street‐level Spatial Scan Statistic and STAC for Analysing Street Crime Concentrations

This study develops new types of hotspot detection methods to describe the micro‐space variation of the locations of crime incidents at the street level. It expands on two of the most widely used hotspot detection methods, Spatial and Temporal Analysis of Crime and Spatial Scan Statistic, and applies them to the analysis of the network space. The study first describes the conceptual and the methodological framework of the new methods followed by analyses using: (1) a simulated distribution of points along the street network; and (2) real street‐crime incident data. The simulation study using simulated point distributions confirms that the proposed methods is more accurate, stable and sensitive in detecting street‐level hotspots than their conventional counterparts are. The empirical analysis with real crime data focuses on the distribution of the drug markets and robberies in downtown Buffalo, NY in 1995 and 1996. The drug markets are found to form hotspots that are dense, compact and stable whereas hotspots of the robberies are observed more thinly across a wider area. The study also reveals that the location of the highest risk remains on the same spot over time for both types of crimes, indicating the presence of hotbeds which requires further attention.     

Towards Real‐Time Geodemographics: Clustering Algorithm Performance for Large Multidimensional Spatial Databases

Geodemographic classifications provide discrete indicators of the social, economic and demographic characteristics of people living within small geographic areas. They have hitherto been regarded as products, which are the final “best” outcome that can be achieved using available data and algorithms. However, reduction in computational cost, increased network bandwidths and increasingly accessible spatial data infrastructures have together created the potential for the creation of classifications in near real time within distributed online environments. Yet paramount to the creation of truly real time geodemographic classifications is the ability for software to process and efficiency cluster large multidimensional spatial databases within a timescale that is consistent with online user interaction. To this end, this article evaluates the computational efficiency of a number of clustering algorithms with a view to creating geodemographic classifications “on the fly” at a range of different geographic scales.     

A Patch‐based Cellular Automaton for Simulating Land‐use Changes at Fine Spatial Resolution

While cellular automata have become popular tools for modeling land‐use changes, there is a lack of studies reporting their application at very fine spatial resolutions (e.g. 5 m resolution). Traditional cell‐based CA do not generate reliable results at such resolutions because single cells might only represent components of land‐use entities (i.e. houses or parks in urban residential areas), while recently proposed entity‐based CA models usually ignore the internal heterogeneity of the entities. This article describes a patch‐based CA model designed to deal with this problem by integrating cell and object concepts. A patch is defined as a collection of adjacent cells that might have different attributes, but that represent a single land‐use entity. In this model, a transition probability map was calculated at each cell location for each land‐use transition using a weight of evidence method; then, land‐use changes were simulated by employing a patch‐based procedure based on the probability maps. This CA model, along with a traditional cell‐based model were tested in the eastern part of the Elbow River watershed in southern Alberta, Canada, an area that is under considerable pressure for land development due to its proximity to the fast growing city of Calgary. The simulation results for the two models were compared to historical data using visual comparison, K_simulation indices, and landscape metrics. The results reveal that the patch‐based CA model generates more compact and realistic land‐use patterns than the traditional cell‐based CA. The K_simulation values indicate that the land‐use maps obtained with the patch‐based CA are in higher agreement with the historical data than those created by the cell‐based model, particularly regarding the location of change. The landscape metrics reveal that the patch‐based model is able to adequately capture the land‐use dynamics as observed in the historical data, while the cell‐based CA is not able to provide a similar interpretation. The patch‐based approach proposed in this study appears to be a simple and valuable solution to take into account the internal heterogeneity of land‐use classes at fine spatial resolutions and simulate their transitions over time.     

Discovering Spatial Patterns in Origin‐Destination Mobility Data

Mobility and spatial interaction data have become increasingly available due to the wide adoption of location‐aware technologies. Examples of mobility data include human daily activities, vehicle trajectories, and animal movements, among others. In this article we focus on a special type of mobility data, i.e. origin‐destination pairs, and present a new approach to the discovery and understanding of spatio‐temporal patterns in the movements. Specifically, to extract information from complex connections among a large number of point locations, the approach involves two steps: (1) spatial clustering of massive GPS points to recognize potentially meaningful places; and (2) extraction and mapping of the flow measures of clusters to understand the spatial distribution and temporal trends of movements. We present a case study with a large dataset of taxi trajectories in Shenzhen, China to demonstrate and evaluate the methodology. The contribution of the research is two‐fold. First, it presents a new methodology for detecting location patterns and spatial structures embedded in origin‐destination movements. Second, the approach is scalable to large data sets and can summarize massive data to facilitate pattern extraction and understanding.     

Spatio‐Temporal Building Population Estimation for Highly Urbanized Areas Using GIS

Detailed population information is crucial for the micro‐scale modeling and analysis of human behavior in urban areas. Since it is not available on the basis of individual persons, it has become necessary to derive data from aggregated census data. A variety of approaches have been published in the past, yet they are not entirely suitable for use in the micro‐scale context of highly urbanized areas, due mainly to their broad spatial scale and missing temporal scale. Here we introduce an enhanced approach for the spatio‐temporal estimation of building populations in highly urbanized areas. It builds upon other estimation methodologies, but extends them by introducing multiple usage categories and the temporal dimension. This allows for a more realistic representation of human activities in highly urbanized areas and the fact that populations change over time as a result of these activities. The model makes use of a variety of micro‐scale data sets to operationalize the activities and their spatio‐temporal representations. The outcome of the model provides estimated population figures for all buildings at each time step and thereby reveals spatio‐temporal behavior patterns. It can be used in a variety of applications concerning the implications of human behavior in urban areas.     

Contour line simplification method based on the two‐level Bellman–Ford algorithm

The contour line is one of the basic elements of a topographic map. Existing contour line simplification methods are generally applied to maps without topological errors. However, contour lines acquired from a digital elevation model (DEM) may contain topological errors before simplification. Targeted at contour lines with topological errors, a progressive simplification method based on the two‐level Bellman–Ford algorithm is proposed in this study. Simplified contour lines and elevation error bands were extracted from the DEM. The contour lines of the elevation error bands were initially simplified with the Bellman–Ford (BF) algorithm. The contour lines were then segmented using the vertices of the initial simplification result and connected curves with the same bending direction were merged into a new curve. Subsequently, various directed graphs of the merged curves were constructed and a second simplification was made using the BF algorithm. Finally, the simplification result was selected based on the similarity between several simplification results and adjacent contour lines. The experimental results indicate that the main shapes of the contour groups can be maintained with this method and original topological errors are resolved.     

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.     

An Ontology‐Driven Framework and Web Portal for Spatial Decision Support1

Numerous systems and tools have been developed for spatial decision support (SDS), but they generally suffer from a lack of re‐usability, inconsistent terminology, and weak conceptualization. We introduce a collaborative effort by the SDS Consortium to build a SDS knowledge portal. We present the formal representation of knowledge about SDS, the various ontologies captured and made accessible by the portal, and the processes used to create them. We describe the portal in action, and the ways in which users can search, browse, and make use of its content. Finally, we discuss the lessons learned from this effort, and future development directions. Our work demonstrates how ontologies and semantic technologies can support the documentation and retrieval of dynamic knowledge in GIScience by offering flexible schemata instead of fixed data structures.     

Cartoblography: Experiments in Using and Organising the Spatial Context of Micro‐blogging

Blogs, micro‐blogs and online forums underpin a more interconnected world. People communicate ever more and are increasingly keen to explain and illustrate their lives; showing where they are and what they are doing. Desktop, online and mobile mapping landscapes have never been as rich or diverse yet this challenges cartography to adapt and remain relevant in the modern mapping world. We explore the spatial expression and potential value of micro‐blogging and Twitter as a social networking tool. Examples of “twitter maps” are reviewed that leverage the Twitter API and online map services to locate some component of the “tweet”. Scope, function and design are illustrated through development of two proof‐of‐concept map mashups that support collaborative real‐time mapping and the organisation and display of information for mass user events. Through the experiments in using and organising data in this way we demonstrate the value of “cartoblography”– a framework for mapping the spatial context of micro‐blogging.     

Understanding the Combined Impacts of Aggregation and Spatial Non‐Stationarity: The Case of Migration‐Environment Associations in Rural South Africa

Socio‐demographic data are typically collected at various levels of aggregation, leading to the modifiable areal unit problem. Spatial non‐stationarity of statistical associations between variables further influences the demographic analyses. This study investigates the implications of these two phenomena within the context of migration‐environment associations. Global and local statistical models are fit across increasing levels of aggregation using household level survey data from rural South Africa. We raise the issue of operational scale sensitivity, which describes how the explanatory power of certain variables depends on the aggregation level. We find that as units of analysis (households) are aggregated, some variables become non‐significant in the global models, while others are less sensitive to aggregation. Local model results show that aggregation reduces spatial variation in migration‐related local associations but also affects variables differently. Spatial non‐stationarity appears to be the driving force behind this phenomenon as the results from the global model mask this relationship. Operational scale sensitivity appears related to the underlying spatial autocorrelation of the non‐aggregated variables but also to the way a variable is constructed. Understanding operational scale sensitivity can help to refine the process of selecting variables related to the scale of analysis and better understand the effects of spatial non‐stationarity on statistical relationships.     

A Spatial Anomaly Points and Regions Detection Method Using Multi‐Constrained Graphs and Local Density

Spatial anomalies may be single points or small regions whose non‐spatial attribute values are significantly inconsistent with those of their spatial neighborhoods. In this article, a S patial A nomaly P oints and R egions D etection method using multi‐constrained graphs and local density ( SAPRD for short) is proposed. The SAPRD algorithm first models spatial proximity relationships between spatial entities by constructing a Delaunay triangulation, the edges of which provide certain statistical characteristics. By considering the difference in non‐spatial attributes of adjacent spatial entities, two levels of non‐spatial attribute distance constraints are imposed to improve the proximity graph. This produces a series of sub‐graphs, and those with very few entities are identified as candidate spatial anomalies. Moreover, the spatial anomaly degree of each entity is calculated based on the local density. A spatial interpolation surface of the spatial anomaly degree is generated using the inverse distance weight, and this is utilized to reveal potential spatial anomalies and reflect their whole areal distribution. Experiments on both simulated and real‐life spatial databases demonstrate the effectiveness and practicability of the SAPRD algorithm.     

Using geographically weighted regression to explore neighborhood‐level predictors of domestic abuse in the UK

Reducing domestic abuse has become a priority for both local and national governments in the UK, with its substantial human, social, and economic costs. It is an interdisciplinary issue, but to date there has been no research in the UK that has focused on neighborhood‐level predictors of domestic abuse and their variation across space. This article uses geographically weighted regression to model the predictors of police‐reported domestic abuse in Essex. Readily available structural and cultural variables were found to predict the domestic abuse rate and the repeat victimization rate at the lower super output area level and the model coefficients were all found to be non‐stationary, indicating varying relationships across space. This research not only has important implications for victims' well being, but also enables policy makers to gain a better understanding of the geography of victimization, allowing targeted policy interventions and efficiently allocated resources.     

Spatial optimization of rural settlement relocation by incorporating inter‐village social connections under future policy scenarios

Social connections between villages can represent farmers’ interests and thus benefit participatory rural relocation planning. With rural development, however, these connections will change and may weaken the adaptation of relocation plans to future rural systems. As yet, most studies still use empirical social connections to guide relocation planning, while a few have incorporated predicted connections in the context of rural development into relocation decisions. Meanwhile, spatial optimization approaches have seldom been adopted to solve this geographical decision issue. Accordingly, our study proposes a novel spatial relocation framework that incorporates changed inter‐village social connections under future rural development scenarios. Empirical inter‐village connections and their policy‐induced changes in central China were explored using social network analysis. An integration of particle swarm optimization and geographic information systems was adopted to identify the relocation solutions with maximum inter‐village connections and maximum spatial land use compactness, and to examine how connection changes under different policy scenarios influenced relocation outcomes. The results demonstrate the significance of incorporating policy‐induced social connections into relocation plans, and most importantly, show the negative relations between changed social connections and the migration distance/direction of relocated settlements. Our study is expected to improve the adaptation of relocation plans to future rural development.