Hiroya Maeda, Y. Sekimoto, Toshikazu Seto, Takehiro Kashiyama, Hiroshi Omata
{"title":"Extraction of Road Maintenance Criteria using Machine Learning and Spatial Information","authors":"Hiroya Maeda, Y. Sekimoto, Toshikazu Seto, Takehiro Kashiyama, Hiroshi Omata","doi":"10.1145/3152178.3152187","DOIUrl":"https://doi.org/10.1145/3152178.3152187","url":null,"abstract":"Infrastructure maintenance requires extensive financial and human resources, and a lack of these resources---and, in particular, a shortage of experts---is a problem in many countries and regions around the world. In response to such circumstances, there is considerable research on infrastructure damage-detection methods using camera images and machine-learning. However, even if a large number of damaged parts are found using such methods, the decision whether to repair damaged areas is nevertheless determined empirically, by taking into account several factors such as road statistics and the regional characteristics. For these reasons, the current situation is that municipalities that lack experts cannot make comprehensive decisions regarding repairs. Therefore, in this research, we extracted maintenance management standards and automated decision-making using the decisions made by local government officials regarding damaged roads in Japan. We focused on roads, because roads are considered to be one of the most influential infrastructure. In order to do so, we cooperated with six municipalities in Japan. We combined statistical information regarding damaged roads with regional characteristics. As a result, in a very understandable way, we were then able to reproduce the decisions made by experts with an accuracy of 0.75. Our research has the potential to enable automated decision-making in the future.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ontology-based Instance Matching for Geospatial Urban Data Integration","authors":"Vivek R. Shivaprabhu, B. Balasubramani, I. Cruz","doi":"10.1145/3152178.3152186","DOIUrl":"https://doi.org/10.1145/3152178.3152186","url":null,"abstract":"To run a smart city, data is collected from disparate sources such as IoT devices, social media, private and public organizations, and government agencies. In the US, the City of Chicago has been a pioneer in the collection of data and in the development of a framework, called OpenGrid, to curate and analyze the collected data. OpenGrid is a geospatial situational awareness platform that allows policy makers, service providers, and the general public to explore city data and to perform advanced data analytics to enable planning of services, prediction of events and patterns, and identification of incidents across the city. This paper presents the instance matching module of GIVA, a Geospatial data Integration, Visualization, and Analytics platform, as applied to the integration of information related to businesses, which is spread across several datasets. In particular, we describe the integration of two datasets, Business Licenses and Food Inspections, so as to enable predictive analytics to determine which food establishments the city should inspect first. The paper describes semantic web-based instance matching mechanisms to compare the Business Names and Address fields.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129698951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"flowHDBSCAN: A Hierarchical and Density-Based Spatial Flow Clustering Method","authors":"Ran Tao, J. Thill, C. Depken, M. Kashiha","doi":"10.1145/3152178.3152189","DOIUrl":"https://doi.org/10.1145/3152178.3152189","url":null,"abstract":"Understanding the patterns and dynamics of spatial origin-destination flow data has been a long-standing goal of spatial scientists. This study aims at developing a new flow clustering method called flowHDBSCAN, which has the potential to be applied to various urban dynamics issues such as spatial movement analysis and intelligent transportation systems. Flows entail origin and destinations pairs, at the exclusion of the actual path in-between. The method combines density-based clustering and hierarchical clustering approaches and extends them to the context of spatial flows. Not only can it extract flow clusters from various situations including varying flow densities, lengths, directions, and hierarchies, but it also provides an effective way to reveal the potentially hierarchical data structure of the clusters. Common issues such as the modifiable areal unit problem (MAUP) of flow endpoints, false positive errors on short flows, and loss of spatial information are well handled. Moreover, the sole-parameter design guarantees its ease of use and practicality. Experiments are conducted with both a synthetic dataset and an eBay online trade flow dataset in the contiguous U.S.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kaiwei Kong, Jian Xu, Ming Xu, Liming Tu, Y. Wu, Zhi Chen
{"title":"Trajectory Query Based on Trajectory Segments with Activities","authors":"Kaiwei Kong, Jian Xu, Ming Xu, Liming Tu, Y. Wu, Zhi Chen","doi":"10.1145/3152178.3152180","DOIUrl":"https://doi.org/10.1145/3152178.3152180","url":null,"abstract":"Searching trajectories with activities has attracted much attention in the last decade. Existing studies tend to find trajectories with activities matched to the required keywords. However, returned trajectories may have a satisfying textual matching but are spatially far from query locations. In this paper, differing with traditional work which return entire trajectories without combination, we focus on the intersecting trajectory segments and combine them into a new trajectory. A challenge of this problem is how to find qualified trajectory segments from the large search space and combine them into required trajectories. To this end, we organize trajectories into a hybrid index which enables us to utilize spatial information to prune search space efficiently. In addition, we propose a algorithm to search intersecting trajectory segments and combine them into qualified trajectories according to requirements. The effectiveness of our method is verified by empirical studies based on a real trajectory data set and a synthetic data set.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Craig A. Knoblock, Aparna R. Joshi, Abhishek Megotia, Minh Pham, Chelsea Ursaner
{"title":"Automatic Spatio-temporal Indexing to Integrate and Analyze the Data of an Organization","authors":"Craig A. Knoblock, Aparna R. Joshi, Abhishek Megotia, Minh Pham, Chelsea Ursaner","doi":"10.1145/3152178.3152185","DOIUrl":"https://doi.org/10.1145/3152178.3152185","url":null,"abstract":"Organizations are awash in data. In many cases, they do not know what data exists within the organization and much information is not available when needed, or worse, information gets recreated from other sources. In this paper, we present an automatic approach to spatio-temporal indexing of the datasets within an organization. The indexing process automatically identifies the spatial and temporal fields, normalizes and cleans those fields, and then loads them into a big data store where the information can be efficiently searched, queried, and analyzed. We evaluated our approach on 600 datasets published by the City of Los Angeles and show that we can automatically process their data and can efficiently access and analyze the indexed data.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127132181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QUIET ZONE: Reducing The Communication Cost of Continuous Spatial Queries","authors":"A. Hidayat, M. A. Cheema","doi":"10.1145/3152178.3152179","DOIUrl":"https://doi.org/10.1145/3152178.3152179","url":null,"abstract":"The client server model has been extensively used to continuously monitor the results of spatial queries. In this paper, we introduce quiet zone that is aimed to reduce the communication cost in the client server model implemented for continuous spatial queries. A quiet zone is a region such that as long as an object remains inside it, the object does not need to report its location. We present a generic framework to reduce the communication cost of many different variety of continuous spatial queries, such as range query, reverse nearest neighbour query, window query and relaxed reverse nearest neighbour query. We show that the checking cost at objects is reasonably low so that our approach is feasible for devices with limited resources. Our experimental study shows that the proposed algorithm significantly reduces the communication cost.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127423670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Continuously Generalizing Buildings to Built-up Areas by Aggregating and Growing","authors":"Dongliang Peng, G. Touya","doi":"10.1145/3152178.3152188","DOIUrl":"https://doi.org/10.1145/3152178.3152188","url":null,"abstract":"To enable smooth zooming, we propose a method to continuously generalize buildings from a given start map to a smaller-scale goal map, where there are only built-up area polygons instead of individual building polygons. We name the buildings on the start map original buildings. For an intermediate scale, we aggregate the original buildings that will become too close by adding bridges. We grow (bridged) original buildings based on buffering, and simplify the grown buildings. We take into account the shapes of the buildings both at the previous map and goal map to make sure that the buildings are always growing. The running time of our method is in O (n3), where n is the number of edges of all the original buildings. The advantages of our method are as follows. First, the buildings grow continuously and, at the same time, are simplified. Second, right angles of buildings are preserved during growing: the merged buildings still look like buildings. Third, the distances between buildings are always larger than a specified threshold. We do a case study to show the performances of our method.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129046715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantitative Comparison of Open-Source Data for Fine-Grain Mapping of Land Use","authors":"Xueqing Deng, S. Newsam","doi":"10.1145/3152178.3152182","DOIUrl":"https://doi.org/10.1145/3152178.3152182","url":null,"abstract":"This paper performs a quantitative comparison of open-source data available on the Internet for the fine-grain mapping of land use. Three points of interest (POI) data sources--Google Places, Bing Maps, and the Yellow Pages--and one volunteered geographic information data source--Open Street Map (OSM)--are compared with each other at the parcel level for San Francisco with respect to a proposed fine-grain land-use taxonomy. The sources are also compared to coarse-grain authoritative data which we consider to be the ground truth. Results show limited agreement among the data sources as well as limited accuracy with respect to the authoritative data even at coarse class granularity. We conclude that POI and OSM data do not appear to be sufficient alone for fine-grain land-use mapping.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"1100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126392957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Linked Data and Visualization: Two Sides of the Transparency Coin","authors":"Auriol Degbelo","doi":"10.1145/3152178.3152191","DOIUrl":"https://doi.org/10.1145/3152178.3152191","url":null,"abstract":"Transparency is an important element of smart cities, and ongoing work is exploring the use of available open data to maximize it. This position paper argues that Linked Data and visualization play similar roles, for different agents, in this context. Linked Data increases transparency for machines, while visualization increases transparency for humans. The work also proposes a quantitative approach to the evaluation of visualization insights which rests on two premises: (i) visualizations could be modelled as a set of statements made by authors at some point in time, and (ii) statements made by experts could be used as ground truth while evaluating how much insights are effectively conveyed by visualizations on the Web. Drawing on the linked data rating scheme of Tim Berners-Lee, the paper proposes a five-stars rating scheme for visualizations on the Web. The ideas suggested are relevant to the development of techniques to automatically assess the transparency level of existing visualizations on the Web.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sobhan Moosavi, Behrooz Omidvar-Tehrani, R. Ramnath
{"title":"Trajectory Annotation by Discovering Driving Patterns","authors":"Sobhan Moosavi, Behrooz Omidvar-Tehrani, R. Ramnath","doi":"10.1145/3152178.3152184","DOIUrl":"https://doi.org/10.1145/3152178.3152184","url":null,"abstract":"The ubiquity and variety of available sensors has enabled the collection of voluminous datasets of car trajectories that enable analysts to make sense of driving patterns and behaviors. One approach to obtain driving behaviors is to break a trajectory into its underlying patterns and then analyze these patterns (aka segmentation). To validate and improve automated trajectory segmentation algorithms, there is a crucial need for a ground-truth against which to compare the results of the algorithms. To the best of our knowledge, no such publicly available ground-truth of car trajectory annotations exists. In this paper, we introduce a trajectory annotation framework and use it to annotate a real-world dataset of personal car trajectories. Our annotation methodology consists of a crowd-sourcing step followed by a precise process of expert aggregation. Our annotation identifies segment borders, and then labels the segment with its type (e.g. speed-up, turn, merge, etc.). The output of our project is a dataset of annotated car trajectories (DACT), and is publicly available for use by the spatiotemporal research community at https://goo.gl/XgsxyJ.","PeriodicalId":378940,"journal":{"name":"Proceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122114509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}