Multi-unit building address geocoding: An approach without indoor location reference data

Accurately mapped locations within multi-unit properties are useful for several organizations in today's society. Published work on geocoding methods either require detailed location reference data or does not apply to multi-unit buildings. In this research, a generalizable method is realized to map apartment addresses to their explicit locations without access to indoor location reference data based on publicly available address- and geospatial-building information. The performance of this approach is measured by conducting a comparative study between a linear interpolation baseline and gradient-boosted decision trees model. The proposed method can successfully geocode addresses across different building shapes and sizes. Furthermore, the model significantly outperforms the baseline in terms of positional accuracy proving the feasibility of approximating apartment locations by their address- and geospatial-building information.     

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.     

An address regional tessellation method for spatial subdivision and geocoding in digital earth system

With the increased use of locational information, spatial location referencing and coding methods have become much more important to the mining of both geographical and nongeographical data in digital earth system. Unfortunately, current methods of geocoding, based on reverse lookup of coordinates for a given address, have proven too lossy with respect to administrative and socioeconomic data. This paper proposes a spatial subdivision and geocoding model based on spatial address regional tessellation (SART). Given a hierarchical address object definition, and based on the ‘region of influence’ characteristics of an address, SART creates multiresolution spatial subdivisions by irregular and continuous address regions. This model reflects most of the geographical features and many of the social and economic implications for a given address. It also better reflects the way people understand addresses and spatial locations. We also propose an appropriate method of geocoding for standard addresses (SART-GC). The codes generated by this method can record address footprints, hierarchical relationships, and spatial scales in a single data structure. Finally, by applying our methods to the Shibei District of Qingdao, we demonstrate the suitability of SART-GC for multi-scale spatial information representation in digital earth systems.     

Geocoding Large Population‐level Administrative Datasets at Highly Resolved Spatial Scales

Using geographic information systems to link administrative databases with demographic, social, and environmental data allows researchers to use spatial approaches to explore relationships between exposures and health. Traditionally, spatial analysis in public health has focused on the county, ZIP code, or tract level because of limitations to geocoding at highly resolved scales. Using 2005 birth and death data from North Carolina, we examine our ability to geocode population‐level datasets at three spatial resolutions – zip code, street, and parcel. We achieve high geocoding rates at all three resolutions, with statewide street geocoding rates of 88.0% for births and 93.2% for deaths. We observe differences in geocoding rates across demographics and health outcomes, with lower geocoding rates in disadvantaged populations and the most dramatic differences occurring across the urban‐rural spectrum. Our results suggest that highly resolved spatial data architectures for population‐level datasets are viable through geocoding individual street addresses. We recommend routinely geocoding administrative datasets to the highest spatial resolution feasible, allowing public health researchers to choose the spatial resolution used in analysis based on an understanding of the spatial dimensions of the health outcomes and exposures being investigated. Such research, however, must acknowledge how disparate geocoding success across subpopulations may affect findings.     

A probabilistic framework for improving reverse geocoding output

Reverse geocoding, which transforms machine‐readable GPS coordinates into human‐readable location information, is widely used in a variety of location‐based services and analysis. The output quality of reverse geocoding is critical because it can greatly impact these services provided to end‐users. We argue that the output of reverse geocoding should be spatially close to and topologically correct with respect to the input coordinates, contain multiple suggestions ranked by a uniform standard, and incorporate GPS uncertainties. However, existing reverse geocoding systems often fail to fulfill these aims. To further improve the reverse geocoding process, we propose a probabilistic framework that includes: (1) a new workflow that can adapt all existing address models and unitizes distance and topology relations among retrieved reference data for candidate selections; (2) an advanced scoring mechanism that quantifies characteristics of the entire workflow and orders candidates according to their likelihood of being the best candidate; and (3) a novel algorithm that derives statistical surfaces for input GPS uncertainties and propagates such uncertainties into final output lists. The efficiency of the proposed approaches is demonstrated through comparisons to the four commercial reverse geocoding systems and through human judgments. We envision that more advanced reverse geocoding output ranking algorithms specific to different application scenarios can be built upon this work.     

Geocoding Recommender: An Algorithm to Recommend Optimal Online Geocoding Services for Applications

Today, many services that can geocode addresses are available to domain scientists and researchers, software developers, and end‐users. For a number of reasons, including quality of reference database and interpolation technique, a given address geocoded by different services does not often result in the same location. Considering that there are many widely available and accessible geocoding services and that each geocoding service may utilize a different reference database and interpolation technique, selecting a suitable geocoding service that meets the requirements of any application or user is a challenging task. This is especially true for online geocoding services which are often used as black boxes and do not provide knowledge about the reference databases and the interpolation techniques they employ. In this article, we present a geocoding recommender algorithm that can recommend optimal online geocoding services by realizing the characteristics (positional accuracy and match rate) of the services and preferences of the user and/or their application. The algorithm is simulated and analyzed using six popular online geocoding services for different address types (agricultural, commercial, industrial, residential) and preferences (match rate, positional accuracy).     

Evaluation of the quality of an online geocoding resource in the context of a large Brazilian city

Geocoding urban addresses usually requires the use of an underlying address database. Under the influence of the format defined for TIGER files decades ago, most address databases and street geocoding algorithms are organized around street centerlines, associating numbering ranges to thoroughfare segments between two street crossings. While this method has been successfully employed in the USA for a long time, its transposition to other countries may lead to increased errors. This article presents an evaluation of the centerline‐geocoding resources provided by Google Maps, as compared to the point‐geocoding method used in the city of Belo Horizonte, Brazil, which we took as a baseline. We generated a textual address for each point object found in the city's point‐based address database, and submitted it to the Google Maps geocoding API. We then compared the resulting coordinates with the ones recorded in Belo Horizonte's GIS. We demonstrate that the centerline segment interpolation method, employed by the online resources following the American practice, has problems that can considerably influence the quality of the geocoding outcome. Completeness and accuracy have been found to be irregular, especially within lower income areas. Such errors in online services can have a significant impact on geocoding efforts related to social applications, such as public health and education, since the online service can be faulty and error‐prone in the most socially demanding areas of the city. In the conclusion, we point out that a volunteered geographic information (VGI) approach can help with the enrichment and enhancement of current geocoding resources, and can possibly lead to their transformation into more reliable point‐based geocoding services.     

Impacts of Positional Error on Spatial Regression Analysis: A Case Study of Address Locations in Syracuse, New York

Positional error is the error produced by the discrepancy between reference and recorded locations. In urban landscapes, locations typically are obtained from global positioning systems or geocoding software. Although these technologies have improved the locational accuracy of georeferenced data, they are not error free. This error affects results of any spatial statistical analysis performed with a georeferenced dataset. In this paper we discuss the properties of positional error in an address matching exercise and the allocation of point locations to census geography units. We focus on the error's spatial structure, and more particularly on impacts of error propagation in spatial regression analysis. For this purpose we use two geocoding sources, we briefly describe the magnitude and the nature of their discrepancies, and we evaluate the consequences that this type of locational error has on a spatial regression analysis of pediatric blood lead data for Syracuse, NY. Our findings include: (1) the confirmation of the recurrence of spatial clustering in positional error at various geographic resolutions; and, (2) the identification of a noticeable but not shockingly large impact from positional error propagation in spatial auto‐binomial regression analysis results for the dataset analyzed.     

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.     

Improvement of a location-aware recommender system using volunteered geographic information

Abstract

Recommender systems (RS), as supportive tools, filter information from a massive amount of data based on the determined preferences. Most of the RS require information about the context of users such as their locations. In such cases, location-aware recommender systems (LARS) can be employed to suggest more personalized items to the users. The most current research projects on LARS focus on the development of algorithms, evaluation methods and applications. However, the role of up-to-date spatial databases in LARS is not a well-researched area. The up-to-date spatial information would potentially improve the accuracy of items which are recommended by LARS. Volunteered geographic information (VGI) could be a low-cost source of up-to-date spatial information for LARS. This article proposes an approach to enrich spatial databases of LARS by VGI. Since not all records of VGI are fitted for use in LARS, a mechanism is developed to identify useful information. Some VGI data sets refer to existing spatial data in the database while other VGI data sets are shared for the first time. Therefore, the proposed method assessed the quality of VGI with reference source (for VGI which is existed in the database) and VGI without reference source (for VGI which is shared for the first time). To demonstrate the feasibility of the proposed approach, a mobile application has been developed to recommend suitable restaurants to the users based on their geospatial locations. The evaluation of the method indicates that VGI can potentially enhance the functionality of the LARS in predicting the users’ interests.     

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.     

A Spatial Conditioned Latin Hypercube Sampling Method for Mapping Using Ancillary Data

For obtaining maps of good precision by the spatial inference method, the distribution of sampling sites in geographical and feature space is very important. For a regional variable with trends, the predicting error comes from trend estimation, variogram estimation and spatial interpolation. Based on the cLHS (conditioned Latin hypercube Sampling) method, a sampling method called scLHS (spatial cLHS) considering all these three aspects with the help of ancillary data is proposed in this article. Its advantage lies in simultaneously improving trend estimation, variogram estimation and spatial interpolation. MODIS data and simulated data were used as sampling fields to draw sample sets using scLHS, cLHS, cLHS with x and y coordinates as covariates, simple random and spatial even sampling methods, and the distribution and prediction errors of sample sets from different methods were evaluated. The results showed that scLHS performed well in balancing spreading in geographic and feature space, and can generate points pairs with small distances, and the sample sets drawn by scLHS produced smaller mapping error, especially when there were trends in the target variable.     

Improving Spatial Accuracy of Roadway Networks and Geocoded Addresses

Exposure to traffic‐related pollutants is associated with both morbidity and mortality. Because vehicle‐exhaust are highly localized, within a few hundred meters of heavily traveled roadways, highly accurate spatial data are critical in studies concerned with exposure to vehicle emissions. We compared the positional accuracy of a widely used U.S. Geological Survey (USGS) roadway network containing traffic activity data versus a global positioning system (GPS)‐validated road network without traffic information; developed a geographical information system (GIS)‐based methodology for producing improved roadway data associated with traffic activities; evaluated errors from geocoding processes; and used the CALINE4 dispersion model to demonstrate potential exposure misclassifications due to inaccurate roadway data or incorrectly geocoded addresses. The GIS‐based algorithm we developed was effective in transferring vehicle activity information from the less accurate USGS roadway network to a GPS‐accurate road network, with a match rate exceeding 95%. Large discrepancies, up to hundreds of meters, were found between the two roadway networks, with the GPS‐validated network having higher spatial accuracy. In addition, identifying and correcting errors associated with geocoding resulted in improved address matching. We demonstrated that discrepancies in roadway geometry and geocoding errors, can lead to serious exposure misclassifications, up to an order of magnitude in assigned pollutant concentrations.     

Positional Accuracy of Spatial Data: Non-Normal Distributions and a Critique of the National Standard for Spatial Data Accuracy

Spatial data quality is a paramount concern in all GIS applications. Existing spatial data accuracy standards, including the National Standard for Spatial Data Accuracy (NSSDA) used in the United States, commonly assume the positional error of spatial data is normally distributed. This research has characterized the distribution of the positional error in four types of spatial data: GPS locations, street geocoding, TIGER roads, and LIDAR elevation data. The positional error in GPS locations can be approximated with a Rayleigh distribution, the positional error in street geocoding and TIGER roads can be approximated with a log‐normal distribution, and the positional error in LIDAR elevation data can be approximated with a normal distribution of the original vertical error values after removal of a small number of outliers. For all four data types considered, however, these solutions are only approximations, and some evidence of non‐stationary behavior resulting in lack of normality was observed in all four datasets. Monte‐Carlo simulation of the robustness of accuracy statistics revealed that the conventional 100% Root Mean Square Error (RMSE) statistic is not reliable for non‐normal distributions. Some degree of data trimming is recommended through the use of 90% and 95% RMSE statistics. Percentiles, however, are not very robust as single positional accuracy statistics. The non‐normal distribution of positional errors in spatial data has implications for spatial data accuracy standards and error propagation modeling. Specific recommendations are formulated for revisions of the NSSDA.     

基于扩展场强模型的稀疏AQI空间插值新算法

针对空气质量指数（AQI）监测点分布稀疏,现有空间插值算法精度不高问题,提出了新的扩展场强模型与算法。扩展场强单参数模型引入参数c控制场强衰减程度,通过c与误差关系图并借助二分查找法计算最优c值。扩展场强双参数模型加入参数k调整场强影响范围,通过c、k与误差关系图并借助迭代双线性插值法求解最优c、k组合。以北京、天津、武汉、郑州四个城市2014-08~2015-04的50组AQI监测值为实验数据,采用交叉验证法并以RMSE、AME、PAEE为评价指标,实现了单参与双参模型及参数选取,然后与克里金法及类似的反距离加权法进行对比。实验证明,扩展场强模型能够得到针对稀疏AQI的更高插值精度,且双参数模型精度高于单参数模型。本文算法适用于采样点数目与位置均固定的稀疏数据插值,并可推广至其他类型与维度的空间数据。     

基于智能手机的校园环境噪声时空分布

针对依靠布设固定监测站的方式收集噪声信息需耗费大量人力、物力和财力,且其所采集数据仅能覆盖有限范围的问题,该文依照群智感知的思路,利用志愿者的智能手机作为信息采集终端,收集中国矿业大学(北京)校园内的噪声监测数据,使用克里金插值法生成噪声地图,在对校园进行功能区划分的基础上,分析校园环境噪声的空间分布差异和各功能区内噪声的时间变化规律。实验结果表明,该文所提方法能根据校园内人群的智能手机采集的数据,快速获取环境噪声的时空分布模式,进而推断时空差异的产生原因。     

Ontology-based integration of topographic data sets

The integration of topographic data sets is defined as the process of establishing relationships between corresponding object instances in different, autonomously produced, topographic data sets of the same geographic space. The problem of integrating topographic data sets is in finding these relationships, considering the differences in content and abstraction. A conceptual framework is developed. Components of this framework are ontologies and sets of surveying rules. New in this approach is the introduction of a reference model. A reference model belongs uniquely to the combination of topographic data sets to be integrated. The framework is tested on two topographic data sets with area instances (polygons) which have crisp and complete boundaries and are not displaced for cartographic reasons. The overall conclusion is that the ontology-based framework is feasible, if (1) there is (at least partial) knowledge of the surveying rules, and (2) the data sets can be synchronized in time. The application of this framework is most suitable for object classes with instances that are easy to identify and have a limited spatial extent (e.g., buildings).     

Improving Geocode Accuracy with Candidate Selection Criteria

Geocoding systems typically use more than one geographic reference dataset to improve match rates and spatial accuracy, resulting in multiple candidate geocodes from which the single “best” result must be selected. Little scientific evidence exists for formalizing this selection process or comparing one strategy to another, leading to the approach used in existing systems which we term the hierarchy‐based criterion: place the available reference data layers into qualitative, static, and in many cases, arbitrary hierarchies and attempt a match in each layer, in order. The first non‐ambiguous match with suitable confidence is selected and returned as output. This approach assumes global relationships of relative accuracy between reference data layers, ignoring local variations that could be exploited to return more precise geocodes. We propose a formalization of the selection criteria and present three alternative strategies which we term the uncertainty‐, gravitationally‐, and topologically‐based strategies. The performance of each method is evaluated against two ground truth datasets of nationwide GPS points to determine any resulting spatial improvements. We find that any of the three new methods improves on current practice in the majority of cases. The gravitationally‐ and topologically‐based approaches offer improvement over a simple uncertainty‐based approach in cases with specific characteristics.     

人口统计数据的空间分布化研究

分析了传统的人口空间分布密度衰减函数－指数型和Gauss型，指出了其应用的局限性，对于有两个中心以上的城市，提出了将人口统计数据空间分布化的思路和方法。     

Quality Assessment of Online Street and Rooftop Geocoding Services

The widespread use of Internet-based mapping and geospatial analysis has caused an increase in the demand for online geocoding services. Although such services provide convenience, low (or free) cost and immediate solutions, their characteristics, sometimes, overshadow the expectation of producing quality of geocoded results. In recent years, several geocoding techniques have emerged, including rooftop geocoding, but they have yet to receive much attention in the literature. This paper examines and compares the quality of online rooftop and street geocoding services based on match rates and positional accuracy. Six geocoding services by five providers (i.e., Microsoft Virtual Earth, Google, Geocoder.us, MapQuest, and Yahoo!) were evaluated using addresses in Allegheny County, Pennsylvania. Results of the comparison indicate that rooftop geocoding produces slightly lower match rates but significantly higher positional accuracy than street geocoding. The hybrid service, which combines the two techniques, produces match rates as high as other street geocoding services but improves in positional accuracy close to the level of rooftop geocoding. Geocoding services employing reference databases with similar quality trend to produce compatible match rates and positional accuracy. This paper examines the sensitivity of different address types on geocoding quality. The results reveal that both rooftop and street geocoding produce high match rates and high accuracy for residential addresses. However, positional accuracies of agricultural and industrial address types are not very reliable due to the small sample sizes. With these, it is recommended to use online rooftop geocoding services if high positional accuracy is the priority, use street geocoding if high match rate is the priority, and use the hybrid approach if both high match rates and high positional accuracy are required.