An OLS regression model for context-aware tile prefetching in a web map cache

The increasing popularity of web map services has motivated the development of more scalable services in the spatial data infrastructures. Tiled map services have emerged as a scalable alternative to traditional map services. Instead of rendering map images on the fly, a collection of pre-generated image tiles can be served very fast from a server-side cache. However, during the start-up of the service, the cache is initially empty and users experience a poor quality of service. Tile prefetching attempts to improve hit rates by proactively fetching map images without waiting for client requests.

While most popular prefetching policies in traditional web caching consider only the previous access history to make predictions, significant improvements could be achieved in web mapping by taking into account the background geographic information.

This work proposes a regressive model to predict which areas are likely to be requested in the future based on spatial cross-correlation between an unconstrained catalog of geographic features and a record of past cache requests. Tiles that are anticipated to be most frequently requested can be pre-generated and cached for faster retrieval. Trace-driven simulations with several million cache requests from two different nation-wide public web map services in Spain demonstrate that accurate predictions and performance gains can be obtained with the proposed model.     

Toward mapping land-use patterns from volunteered geographic information

A large number of applications have been launched to gather geo-located information from the public. This article introduces an approach toward generating land-use patterns from volunteered geographic information (VGI) without applying remote-sensing techniques and/or engaging official data. Hence, collaboratively collected OpenStreetMap (OSM) data sets are employed to map land-use patterns in Vienna, Austria. Initially the spatial pattern of the landscape was delineated and thereafter the most relevant land type was assigned to each land parcel through a hierarchical GIS-based decision tree approach. To evaluate the proposed approach, the results are compared with the Global Monitoring for Environment and Security Urban Atlas (GMESUA) data. The results are compared in two ways: first, the texture of the resulting land-use patterns is analyzed using texture-variability analysis. Second, the attributes assigned to each land segment are evaluated. The achieved land-use map shows kappa indices of 91, 79, and 76% agreement for location in comparison with the GMESUA data set at three levels of classification. Furthermore, the attributes of the two data sets match at 81, 67, and 65%. The results demonstrate that this approach opens a promising avenue to integrate freely available VGI to map land-use patterns for environmental planning purposes.     

Anomalous behavior detection in single-trajectory data

This paper presents an original approach to dynamic anomalous behavior detection in individual trajectory using a recursive Bayesian filter. The anomalous pattern detection is of great interest for navigation, driver assistance systems, surveillance as well as crisis management. In this work, we focus on the GPS trajectories of automobiles finding where the driver’s behavior shows anomalies. Such anomalous behaviors can happen in many cases, especially when the driver encounters orientation problems, i.e., taking a wrong turn, performing a detour, or losing the way. First, three high-level features, i.e., turns and their density, detour factor, and route repetition are extracted from the given trajectory geometry, for which a long-term perspective is required to observe data sequences of a significant length instead of individual time stamps. We therefore employ high-order Markov chains with a ‘dynamic memory’ to model the trajectory integrating these long-term features. The Markov model is processed by a proposed recursive Bayesian filter to infer an optimal probability distribution of the potential anomalous driving behaviors dynamically over time. The filter performs unsupervised detection in single trajectories based on local features only. No training process is required to characterize the anomalous behaviors. By analyzing the detection results of individual trajectories, collective behaviors can be derived indicating traffic issues such as congestions and turn restrictions. Experiments are performed on volunteered geographic information (VGI) data, self-acquired trajectories, and open trajectory datasets to demonstrate the potential of the proposed approach.     

Mining spatiotemporal association patterns from complex geographic phenomena

ABSTRACT

Spatiotemporal association pattern mining can discover interesting interdependent relationships among various types of geospatial data. However, existing mining methods for spatiotemporal association patterns usually model geographic phenomena as simple spatiotemporal point events. Therefore, they cannot be applied to complex geographic phenomena, which continuously change their properties, shapes or locations, such as storms and air pollution. The most salient feature of such complex geographic phenomena is the geographic dynamic. To fully reveal dynamic characteristics of complex geographic phenomena and discover their associated factors, this research proposes a novel complex event-based spatiotemporal association pattern mining framework. First, a complex geographic event was hierarchically modeled and represented by a new data structure named directed spatiotemporal routes. Then, sequence mining technique was applied to discover the spatiotemporal spread pattern of the complex geographic events. An adaptive spatiotemporal episode pattern mining algorithm was proposed to discover the candidate driving factors for the occurrence of complex geographic events. Finally, the proposed approach was evaluated by analyzing the air pollution in the region of Beijing-Tianjin-Hebei. The experimental results showed that the proposed approach can well address the geographic dynamic of complex geographic phenomena, such as the spatial spreading pattern and spatiotemporal interaction with candidate driving factors.     

An ensemble approach to space–time interpolation

The availability of spatial data on an unprecedented scale as well as advancements in analytical and visualization techniques gives researchers the opportunity to study complex problems over large urban and regional areas. Nevertheless, few individual data sets exist that provide both the requisite spatial and/or temporal observational frequency to truly facilitate detailed investigations. Some data are collected frequently over time but only at a few geographic locations (e.g., weather stations). Similarly, other data are collected with a high level of spatial resolution but not at regular or frequent time intervals (e.g., satellite data). The purpose of this article is to present an interpolation approach that leverages the relative temporal richness of one data set with the relative spatial richness of another to fill in the gaps. Because different interpolation techniques are more appropriate than others for specific types of data, we propose a space–time interpolation approach whereby two interpolation methods – one for the temporal and one for the spatial dimension – are used in tandem to increase the accuracy results.

We call our ensemble approach the space–time interpolation environment (STIE). The primary steps within this environment include a spatial interpolation processor, a temporal interpolation processor, and a calibration processor, which enforces phenomenon-related behavioral constraints. The specific interpolation techniques used within the STIE can be chosen on the basis of suitability for the data and application at hand. In this article, we first describe STIE conceptually including the data input requirements, output structure, details of the primary steps, and the mechanism for coordinating the data within those steps. We then describe a case study focusing on urban land cover in Phoenix, Arizona, using our working implementation. Our empirical results show that our approach increased the accuracy for estimating urban land cover better than a single interpolation technique.     

Computing the semantic similarity of geographic terms using volunteered lexical definitions

Volunteered geographic information (VGI) is generated by heterogenous ‘information communities’ that co-operate to produce reusable units of geographic knowledge. A consensual lexicon is a key factor to enable this open production model. Lexical definitions help demarcate the boundaries of terms, forming a thin semantic ground on which knowledge can travel. In VGI, lexical definitions often appear to be inconsistent, circular, noisy and highly idiosyncratic. Computing the semantic similarity of these ‘volunteered lexical definitions’ has a wide range of applications in GIScience, including information retrieval, data mining and information integration. This article describes a knowledge-based approach to quantify the semantic similarity of lexical definitions. Grounded in the recursive intuition that similar terms are described using similar terms, the approach relies on paraphrase-detection techniques and the lexical database WordNet. The cognitive plausibility of the approach is evaluated in the context of the OpenStreetMap (OSM) Semantic Network, obtaining high correlation with human judgements. Guidelines are provided for the practical usage of the approach.     

Interactive discovery of sequential patterns in time series of wind data

Wind speed and direction vary over space and time due to the interactions between different pressures and temperature gradients within the atmospheric layers. Near the earth’s surface, these interactions are modulated by topography and artificial structures. Hence, characterizing wind behaviour over large areas and long periods is a complex but essential task for various energy-related applications. In this study, we present a novel approach to discover wind patterns by integrating sequential pattern mining and interactive visualization techniques. The approach relies on the use of the Linear time Closed pattern Miner sequence algorithm in conjunction with a time sliding window that allows the discovery of all sequential patterns present in the data. These patterns are then visualized using integrated 2D and 3D coordinated multiple views and visually explored to gain insight into the characteristics of the wind from a spatial, temporal and attribute (type of wind pattern) point of view. This proposed approach is used to analyse 10 years of hourly wind speed and direction data for 29 weather stations in the Netherlands. The results show that there are 15 main sequential patterns in the data. The spatial task shows that weather stations located in the same region do not necessarily experience similar wind pattern. For within the selected time interval, similar wind patterns can be observed in different stations and in the same station at different times of occurrence. The attribute task discovered that the repetitive occurrences of chosen pattern indicate as regular wind behaviour at different weather stations that persisted continuously over time. The results of these tasks show that the proposed interactive discovery facilitates the understanding of wind dynamics in space and time.     

World Patterns of Geographic Literacy Based on Sketch Map Quality

This paper discusses world patterns of geographic literacy and illiteracy based on the quality of sketch maps of the world drawn by university students in first-year geography classes. The study, sponsored by the International Geographical Union and funded by the National Geographic Society, contains 3,568 sketch maps of the world collected from 75 sites in 52 countries. For the purposes of this paper, geographic literacy is equated with the number of nations and continents included on the sketch maps. The individual map scores are aggregated to determine the average number of items per map for each site and nation. Our set of maps provides a baseline of world variations in geographic literacy just prior to the end of the Cold War. The sketch map techniques can be used to monitor changes in geographic literacy.     

Creation of Histograms for Data in Various Mineral Resource and Engineering Problems: A Review of Existing Methods and a Proposed New Method to Define Bin Number

Histograms are widely used in geosciences for data analysis and visualization. In cases where a distribution is not fitted to data, histograms are often used to address various sampling- and interpolation-related aspects. However, the results of these applications are substantially affected by the histogram’s number of bins as determined by several binning methods. This paper proposes a new binning approach and compares it with various standard approaches to demonstrate the relative performance of the new approach. Cut-off grade optimization for polymetallic deposits, Monte-Carlo modeling, and derivation of conditional distribution, all of which use histograms, are used as case studies. The proposed technique is based on calculating the squared error for each bin in a histogram, and combining the error values to evaluate the total error for each histogram. The new technique then selects the bin number which minimizes the total error. The results showed that the new binning approach is well suited for binning small datasets and can be used in geoscience applications if needed.     

Planar and non-planar topologically consistent vector map simplification

This article contains a mathematical analysis of strategies for determining topological consistency of vector map simplifications. Such techniques exploit assumptions that can be made regarding the similarity of corresponding objects in successive simplifications. We propose that all topological relationships may be classified as planar or non-planar. A formal analysis of techniques for determining topological consistency of a simplification in terms of such relationships is presented. For each technique we analyse any corresponding constraints that are imposed. This provides a unified understanding of the benefits and limitations of individual techniques and the relationships that exist between techniques. Subsequently, a new strategy for determining the topological consistency of a simplification is proposed. This technique integrates the benefits all methods studied to provide a solution which is subject to less constraints. The effectiveness of this approach is demonstrated through fusion with an existing simplification technique resulting in simplifications that have equal topology and similar shaped features to the original map.     

An Extended Minimum Spanning Tree method for characterizing local urban patterns

Detailed and precise information on urban building patterns is essential for urban design, landscape evaluation, social analyses and urban environmental studies. Although a broad range of studies on the extraction of urban building patterns has been conducted, few studies simultaneously considered the spatial proximity relations and morphological properties at a building-unit level. In this study, we present a simple and novel graph-theoretic approach, Extended Minimum Spanning Tree (EMST), to describe and characterize local building patterns at building-unit level for large urban areas. Building objects with abundant two-dimensional and three-dimensional building characteristics are first delineated and derived from building footprint data and high-resolution Light Detection and Ranging data. Then, we propose the EMST approach to represent and describe both the spatial proximity relations and building characteristics. Furthermore, the EMST groups the building objects into different locally connected subsets by applying the Gestalt theory-based graph partition method. Based on the graph partition results, our EMST method then assesses the characteristics of each building to discover local patterns by employing the spatial autocorrelation analysis and homogeneity index. We apply the proposed method to the Staten Island in New York City and successfully extracted and differentiated various local building patterns in the study area. The results demonstrate that the EMST is an effective data structure for understanding local building patterns from both geographic and perceptual perspectives. Our method holds great potential for identifying local urban patterns and provides comprehensive and essential information for urban planning and management.     

TWO METHODS FOR INVESTIGATING THE GEOGRAPHIC DISTRIBUTION OF DIURNAL PRECIPITATION PATTERNS *

Two alternative approaches for the depiction of the geographic distribution of diurnal precipitation patterns are presented. The standard deviation method results in a plot of significant peak precipitation hours for several locations along a transect. The correlation fields approach allows researchers to visualize geographic patterns significantly associated with a given diurnal precipitation distribution. These techniques may be applied to reveal changes in diurnal patterns over both space and time.     

A bidirectional path-finding algorithm and data structure for maritime routing

Route planning is an important problem for many real-time applications in open and complex environments. The maritime domain is a relevant example of such environments where dynamic phenomena and navigation constraints generate difficult route finding problems. This paper develops a spatial data structure that supports the search for an optimal route between two locations while minimizing a cost function. Although various search algorithms have been proposed so far (e.g. breadth-first search, bidirectional breadth-first search, Dijkstra’s algorithm, A^*, etc.), this approach provides a bidirectional dynamic routing algorithm which is based on hexagonal meshes and an iterative deepening A^* (IDA^*) algorithm, and a front to front strategy using a dynamic graph that facilitates data accessibility. The whole approach is applied to the context of maritime navigation, taking into account navigation hazards and restricted areas. The algorithm developed searches for optimal routes while minimizing distance and computational time.     

Discovering relative motion patterns in groups of moving point objects

Technological advances in position‐aware devices are leading to a wealth of data documenting motion. The integration of spatio‐temporal data‐mining techniques in GIScience is an important research field to overcome the limitations of static Geographic Information Systems with respect to the emerging volumes of data describing dynamics. This paper presents a generic geographic knowledge discovery approach for exploring the motion of moving point objects, the prime modelling construct to represent GPS tracked animals, people, or vehicles. The approach is based on the concept of geospatial lifelines and presents a formalism for describing different types of lifeline patterns that are generalizable for many application domains. Such lifeline patterns allow the identification and quantification of remarkable individual motion behaviour, events of distinct group motion behaviour, so as to relate the motion of individuals to groups. An application prototype featuring novel data‐mining algorithms has been implemented and tested with two case studies: tracked soccer players and data points representing political entities moving in an abstract ideological space. In both case studies, a set of non‐trivial and meaningful motion patterns could be identified, for instance highlighting the characteristic ‘offside trap’ behaviour in the first case and identifying trendsetting districts anticipating a political transformation in the latter case.     

Mining candidate causal relationships in movement patterns

In many applications, the environmental context for and drivers of movement patterns are just as important as the patterns themselves. This article adapts standard data mining techniques, combined with a foundational ontology of causation, with the objective of helping domain experts identify candidate causal relationships between movement patterns and their environmental context. In addition to data about movement and its dynamic environmental context, our approach requires as input definitions of the states and events of interest. The technique outputs causal and causal-like relationships of potential interest, along with associated measures of support and confidence. As a validation of our approach, the analysis is applied to real data about fish movement in the Murray River in Australia. The results demonstrate that the technique is capable of identifying statistically significant patterns of movement indicative of causal and causal-like relationships.     

A method for discovery and analysis of temporal patterns in complex event data

Pattern analysis techniques currently common within geography tend to focus either on characterizing patterns of spatial and/or temporal recurrence of a single event type (e.g., incidence of flu cases) or on comparing sequences of a limited number of event types where relationships between events are already represented in the data (e.g., movement patterns). The availability of large amounts of multivariate spatiotemporal data, however, requires new methods for pattern analysis. Here, we present a technique for finding associations among many different event types where the associations among these varying event types are not explicitly represented in the data or known in advance. This pattern discovery method, known as T-pattern analysis, was first developed within the field of psychology for the purpose of finding patterns in personal interactions. We have adapted and extended the T-pattern method to take the unique characteristics of geographic data into account and implemented it within a geovisualization toolkit for an integrated computational-geovisual environment we call STempo. To demonstrate how T-pattern analysis can be employed in geographic research for discovering patterns in complex spatiotemporal data, we describe a case study featuring events from news reports about Yemen during the Arab Spring of 2011–2012. Using supplementary data from the Global Database of Events, Language, and Tone, we briefly summarize and reference a separate validation study, then evaluate the scalability of the T-pattern approach. We conclude with ideas for further extensions of the T-pattern technique to increase its utility for spatiotemporal analysis.     

Reservoir Modeling by Data Integration via Intermediate Spaces and Artificial Intelligence Tools in MPS Simulation Frameworks

Conditioning stochastic simulations are very important in many geostatistical applications that call for the introduction of nonlinear and multiple-point data in reservoir modeling. Here, a new methodology is proposed for the incorporation of different data types into multiple-point statistics (MPS) simulation frameworks. Unlike the previous techniques that call for an approximate forward model (filter) for integration of secondary data into geologically constructed models, the proposed approach develops an intermediate space where all the primary and secondary data are easily mapped onto. Definition of the intermediate space, as may be achieved via application of artificial intelligence tools like neural networks and fuzzy inference systems, eliminates the need for using filters as in previous techniques. The applicability of the proposed approach in conditioning MPS simulations to static and geologic data is verified by modeling a real example of discrete fracture networks using conventional well-log data. The training patterns are well reproduced in the realizations, while the model is also consistent with the map of secondary data.     

Analysis of positional uncertainty of road networks in volunteered geographic information with a statistically defined buffer-zone method

Volunteered geographic information (VGI) is crowdsourced information that can enrich and enhance research and applications based on geo-referenced data. However, the quality of VGI is of great concern, and positional accuracy is a fundamental basis for the VGI quality assurance. A buffer-zone method can be used for its assessment, but the buffer radius in this technique is subjectively specified; as result, different selections of the buffer radius lead to different positional accuracies. To solve this problem, a statistically defined buffer zone for the positional accuracy assessment in VGI is proposed in this study. To facilitate practical applications, we have also developed an iterative method to obtain a theoretically defined buffer zone. In addition to the positional accuracy assessment, we have derived a measure of positional quality, which comprises the assessment of positional accuracy and the level of confidence in such assessment determined with respect to a statistically defined buffer zone. To illustrate and substantiate the theoretical arguments, both numerical simulations and real-life experiments are performed using OpenStreetMap. The experimental results confirm the high significance of the proposed statistical approach to the buffer zone-based assessment of the positional uncertainty in VGI.     

沈阳市部门企业地理集聚与城市结构

基于产业空间聚集分布情况探寻城市结构特征,是当前大都市区实证研究中的聚焦点所在,但由于方法论的限制而无法真正揭示产业地理集聚之间的内在关联性。基于已有研究基础,试图通过完善潜力模型、设置距离参数、结合主成分分析法实现对产业地理集聚测度方法论的完善与发展,并选取极具代表性大都市区核心城市——沈阳市为样本单元,以2008年的经济普查部门企业数据开展实证检验。结果表明：沈阳市部门企业之间除了交通运输、仓储和邮政中心产业属于地方化经济外,其余的均为企业关联;水利、环境和公共设施管理业产业依附于制造业呈临街抑或隔街集聚,而与公共管理和组织产业之间同街道集聚;支配主角之间,存在中心CBD主宰制造业的布局,而制造业又在很大程度上影响着交通运输、仓储和邮政中心的布局;企业地理集聚形成的城市结构依然是一个明显的“单中心圈层”结构,没有表现出“去中心化”抑或多极化或分散化演变趋势。研究成果与现实情况基本吻合,侧面说明该模式对揭示城市产业地理集聚模式以及由此形成的城市结构特征具有一定的解释力。     

Identifying primary public transit corridors using multi-source big transit data

ABSTRACT

Effective public transit planning needs to address realistic travel demands, which can be illustrated by corridors across major residential areas and activity centers. It is vital to identify public transit corridors that contain the most significant transit travel demand patterns. We propose a two-stage approach to discover primary public transit corridors at high spatio-temporal resolutions using massive real-world smart card and bus trajectory data, which manifest rich transit demand patterns over space and time. The first stage was to reconstruct chained trips for individual passengers using multi-source massive public transit data. In the second stage, a shared-flow clustering algorithm was developed to identify public transit corridors based on reconstructed individual transit trips. The proposed approach was evaluated using transit data collected in Shenzhen, China. Experimental results demonstrated that the proposed approach is a practical tool for extracting time-varying corridors for many potential applications, such as transit planning and management.