{"title":"Eyewitness: identifying local events via space-time signals in twitter feeds","authors":"John Krumm, E. Horvitz","doi":"10.1145/2820783.2820801","DOIUrl":"https://doi.org/10.1145/2820783.2820801","url":null,"abstract":"We present a methodology for automatically extracting and summarizing reports of significant local events from large-scale Twitter feeds. While previous work has relied on an analysis of tweet text to identify local events, we show how to reliably detect events using only time series analysis of geotagged tweet volumes from localized regions. The algorithm sweeps through different spatial and temporal resolutions and finds events as anomalous spikes in the rate of geotagged tweets. We applied the approach to a corpus of over 733 million geotagged tweets. Using a panel of 103 crowdsourced judges who tagged 2400 detected events, we achieved a local event detection precision of 70%. Using these judged events as ground truth, a decision tree classifier was able to raise the detection precision to 93%.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124994794","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}
M. D. Berg, Constantinos Tsirogiannis, Bryan T. Wilkinson
{"title":"Fast computation of categorical richness on raster data sets and related problems","authors":"M. D. Berg, Constantinos Tsirogiannis, Bryan T. Wilkinson","doi":"10.1145/2820783.2820825","DOIUrl":"https://doi.org/10.1145/2820783.2820825","url":null,"abstract":"In many scientific fields, it is common to encounter raster data sets consisting of categorical data, such as soil type or land usage of a terrain. A problem that arises in the presence of such data is the following: given a raster G of n cells storing categorical data, compute for every cell c in G the number of different categories appearing within a window centered at c. The window can either be a (2r+1)x(2r+1) square or a disk of radius r for a positive integer parameter r. We call this the categorical richness problem, and we present two algorithms for it: one for square windows that runs in O(n) time and one for circular windows that runs in O((1+K/r)n) time, where K is the number of distinct categories in G. The algorithms are not only efficient in theory, but also in practice: our experiments show that our algorithms can handle raster data of hundreds of millions of cells. The categorical richness problem is related to colored range counting, where the goal is to preprocess a colored point set such that we can efficiently count the number of colors appearing inside a query range. We present a data structure for colored range counting in R2 for the case where query ranges are squares. Our structure uses O(n polylog n) storage and has O(polylog n) query time, which is significantly better than what is known for arbitrary rectangular ranges.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"54 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116784374","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}
Zack Z. Zhu, J. Yang, Chen Zhong, J. Seiter, G. Tröster
{"title":"Learning functional compositions of urban spaces with crowd-augmented travel survey data","authors":"Zack Z. Zhu, J. Yang, Chen Zhong, J. Seiter, G. Tröster","doi":"10.1145/2820783.2820832","DOIUrl":"https://doi.org/10.1145/2820783.2820832","url":null,"abstract":"Regions in urban environments often afford a mixture of different utilities. Their identification allows urban planners to leverage important insights on the emerging functional dynamics of cities. With the increasing availability of human mobility data and other forms of online digital breadcrumbs, we can now characterize urban regions with multi-source features. In this work, we form a comprehensive view of urban regions by fusing features depicting their temporal, spatial, and demographic aspects. Aggregating 47K explicitly stated trip purposes into their respective destination regions, we obtain multi-dimensional ground-truths on the functionalities of urban spaces. Given fused features and training labels, we can perform supervised learning, via multi-output regression, to estimate the functional composition of urban spaces. With 14 functional dimensions, our approach using crowd-augmented travel survey predictors delivers a mean absolute error of 3.9, approximately half of the error resulting from a mean-based straw man approach (mean absolute error of 7.9). Clustering estimated regional functionalities, we find highly coherent cluster assignments (adjusted Rand Index of 0.81) compared to clustering directly on regional functionality labels. Finally, we provide an illustrative case-study where clustering of estimated region functionalities can be used to intuitively differentiate prototypical spatial neighbourhoods of a large metropolitan.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173809","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":"Combining range-based and range-free methods: a unified approach for localization","authors":"Anthony Quattrone, L. Kulik, E. Tanin","doi":"10.1145/2820783.2820839","DOIUrl":"https://doi.org/10.1145/2820783.2820839","url":null,"abstract":"Localization schemes used for positioning are currently based on either range-based or range-free principles. We propose a unified approach that combines the strengths of both methods while overcoming their limitations. Range-based methods rely on taking reliable measurements in which geometric techniques are then applied. These techniques are very susceptible to imprecision in captured measurements. Range-free methods do not consider the actual numerical sensor value, rather comparing magnitudes across sensors. These comparisons are not always reliable and may lead to an accumulation of errors. Our unified approach mitigates these effects by first using a range-based method to determine an approximate location followed by a range-free method to refine the positioning estimate further. Our experiments show the mean estimation error improves when applying our localization scheme to a Bluetooth system.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127681532","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}
L. Beckmann, B. Budig, Thomas C. van Dijk, J. Schamel
{"title":"There and back again: using fréchet-distance diagrams to find trajectory turning points","authors":"L. Beckmann, B. Budig, Thomas C. van Dijk, J. Schamel","doi":"10.1145/2820783.2820878","DOIUrl":"https://doi.org/10.1145/2820783.2820878","url":null,"abstract":"There is much interest in the automatic analysis of GPS trajectories, motivated amongst others by animal tracking, traffic modelling and tourism studies. Core questions involve for example detecting stopping points and flocking behaviour, and developing routing models. In this paper we consider turning points. We develop a formal definition of \"turning point\" based on analysing the structure of free-space diagrams for Fréchet distance. We give an efficient algorithm for computing an optimal set of turning points under this criterion. Our method is evaluated in the context of a current study on tourist preferences at Berchtesgaden National Park, Germany. We evaluate the suitability of our definition and the efficiency of our algorithm on a large set of real-world GPS trajectories collected by outdoor recreationists. A ground truth of turning points was established by hand for the complete data set. Experiments show that the runtime and quality of our method are suitable for practical applications.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127684023","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":"Vision paper: the future of scientific terrain visualization","authors":"Matthias Thöny, M. Billeter, R. Pajarola","doi":"10.1145/2820783.2820884","DOIUrl":"https://doi.org/10.1145/2820783.2820884","url":null,"abstract":"Terrain rendering is widely used in industry and research. GIS software packages as well as navigation systems make use of terrain rendering to visualize terrain information. Recent trends in research show that scientific terrain visualization is shifting more and more to an interactive analysis tool. This allows domain specific users to perform visual analysis tasks within an interactive visual environment. Visual analysis tools are software package acting as a toolbox and providing functionality to support the work of domain specific users such as data exploration, data analysis and data presentation. Such software packages still suffer from limitations such as restricted or imprecise data and problems with large data handling. These challenges will also be at the core of research in scientific terrain visualization in the near future. In this paper we describe some open challenges for scientific terrain visualization in the acquisition, processing and rendering of terrain related geospatial information as well as new methods which could be used to address these challenges.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126622383","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}
A. Eldawy, Mostafa Elganainy, Ammar Bakeer, A. Abdelmotaleb, M. Mokbel
{"title":"Sphinx: distributed execution of interactive SQL queries on big spatial data","authors":"A. Eldawy, Mostafa Elganainy, Ammar Bakeer, A. Abdelmotaleb, M. Mokbel","doi":"10.1145/2820783.2820869","DOIUrl":"https://doi.org/10.1145/2820783.2820869","url":null,"abstract":"This paper presents Sphinx, a full-fledged distributed system which uses a standard SQL interface to process big spatial data. Sphinx adds spatial data types, indexes and query processing, inside the code-base of Cloudera Impala for efficient processing of spatial data. In particular, Sphinx is composed of four main components, namely, query parser, indexer, query planner, and query executor. The query parser injects spatial data types and functions in the SQL interface of Sphinx. The indexer creates spatial indexes in Sphinx by adopting a two-layered index design. The query planner utilizes these indexes to construct efficient query plans for range query and spatial join operations. Finally, the query executor carries out these plans on big spatial datasets in a distributed cluster. A system prototype of Sphinx running on real datasets shows up-to three orders of magnitude performance improvement over traditional Impala.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115648085","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":"Stochastic location optimization in a dynamic environment","authors":"Hongliang Guo, Yubo Dong, S. Ho","doi":"10.1145/2820783.2820787","DOIUrl":"https://doi.org/10.1145/2820783.2820787","url":null,"abstract":"Existing location optimization solutions only consider the positioning of resouces/seeds at the best location in a target area by minimizing a certain metric over distance. In reality, what really matters is time. In this paper, the location optimization problem is formulated as the expected response time minimization problem rather than a distance minimization problem. Moreover, we propose an algorithm that takes into consideration various stochastic factors which affect the location optimization problem, such as non-uniform probability distribution of the demands, road congestion level, and vehicles' maximum speed. Our proposed algorithm shows promising performance when the disparity among vehicle capabilities (e.g., maximum speed) are large and the environment constraints (e.g., traffic jam) are taken into consideration.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943087","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":"Traffic prediction in a bike-sharing system","authors":"Yexin Li, Yu Zheng, Huichu Zhang, Lei Chen","doi":"10.1145/2820783.2820837","DOIUrl":"https://doi.org/10.1145/2820783.2820837","url":null,"abstract":"Bike-sharing systems are widely deployed in many major cities, providing a convenient transportation mode for citizens' commutes. As the rents/returns of bikes at different stations in different periods are unbalanced, the bikes in a system need to be rebalanced frequently. Real-time monitoring cannot tackle this problem well as it takes too much time to reallocate the bikes after an imbalance has occurred. In this paper, we propose a hierarchical prediction model to predict the number of bikes that will be rent from/returned to each station cluster in a future period so that reallocation can be executed in advance. We first propose a bipartite clustering algorithm to cluster bike stations into groups, formulating a two-level hierarchy of stations. The total number of bikes that will be rent in a city is predicted by a Gradient Boosting Regression Tree (GBRT). Then a multi-similarity-based inference model is proposed to predict the rent proportion across clusters and the inter-cluster transition, based on which the number of bikes rent from/ returned to each cluster can be easily inferred. We evaluate our model on two bike-sharing systems in New York City (NYC) and Washington D.C. (D.C.) respectively, confirming our model's advantage beyond baseline approaches (0.03 reduction of error rate), especially for anomalous periods (0.18/0.23 reduction of error rate).","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131348933","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}
Reem Y. Ali, Venkata M. V. Gunturi, S. Shekhar, A. Eldawy, M. Mokbel, Andrew J. Kotz, W. Northrop
{"title":"Future connected vehicles: challenges and opportunities for spatio-temporal computing","authors":"Reem Y. Ali, Venkata M. V. Gunturi, S. Shekhar, A. Eldawy, M. Mokbel, Andrew J. Kotz, W. Northrop","doi":"10.1145/2820783.2820885","DOIUrl":"https://doi.org/10.1145/2820783.2820885","url":null,"abstract":"Modern vehicles are increasingly being equipped with rich instrumentation that enables them to collect location aware data on a wide variety of travel related phenomena such as the real-world performance of engines and powertrain, driver preferences, context of the vehicle with respect to others nearby, and--indirectly--traffic on the transportation network itself. Combined with their increased access to the Internet, these connected vehicles are opening up vast opportunities to improve the safety, environmental friendliness, and the overall experience of urban travel. However, significant spatial computing challenges need to be addressed before we can realize the full potential of connected vehicles. This paper presents some of the open research questions under this theme from the perspectives of query processing, data science and data engineering.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131866877","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}