{"title":"TOSCA: two-steps clustering algorithm for personal locations detection","authors":"Riccardo Guidotti, R. Trasarti, M. Nanni","doi":"10.1145/2820783.2820818","DOIUrl":"https://doi.org/10.1145/2820783.2820818","url":null,"abstract":"One of the key tasks in mobility data analysis is the study of the individual mobility of users with reference to their personal locations, i.e. the places or areas where they stop to perform any kind of activities. Correctly discovering such personal locations is therefore a very important problem, which is yet not very well addressed in literature. In this work we propose a robust, efficient, statistically well-founded and parameter-free personal location detection process. The algorithm, called TOSCA (TwO-Steps parameter free Clustering Algorithm), combines two clustering strategies and applies statistical tests to drive the selection of the needed parameters. The proposed solution is tested against a large set of competitors and several datasets, including synthetic and real ones. The empirical results show its ability to automatically adapt to different contexts yielding good accuracy and a good efficiency.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"4 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":"122578068","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":"Trajectory inference for mobile devices using connected cell towers","authors":"K. Perera, T. Bhattacharya, L. Kulik, J. Bailey","doi":"10.1145/2820783.2820804","DOIUrl":"https://doi.org/10.1145/2820783.2820804","url":null,"abstract":"Trajectory inference from raw location samples of a mobile device is an important task for many location based services, such as crowd sourced traffic monitoring, fleet management and personalized trip planning. This task becomes challenging when location samples are obtained only from the connected cell towers (GSM localization), instead of using other localization sensors such as GPS or Wi-Fi. Cell tower based localization consumes negligible energy compared to GPS or Wi-Fi and has high availability. However, it can have large inaccuracy, making the task of cellular trajectory mapping extremely challenging. In previous studies, cellular trajectory inference has been performed assuming the availability of knowledge of the cellular network or the signal strengths of the neighbouring cell towers. However, for a mobile application running on a user's device, this information may be hard to obtain and it may also require additional storage and computation costs. In this paper, we propose a novel cellular trajectory inference method which requires only the user's connected cell tower location, time and speed information. Exploiting the preciseness of the time dimension, we accurately compute the distance a user has travelled within a cell and use it to infer the straight line segments and turning points of a trajectory. We show that using the distance information of three consecutive cells, exact inference of the line segment is possible. Our method achieves high accuracy for trajectory inference in urban areas with high cell density and straight line road segments. It does not require any historical trajectory information or pre-training and incurs low storage and computation costs.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"124 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":"121386501","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":"Spatial queries with k-nearest-neighbor and relational predicates","authors":"Ahmed M. Aly, Walid G. Aref, M. Ouzzani","doi":"10.1145/2820783.2820815","DOIUrl":"https://doi.org/10.1145/2820783.2820815","url":null,"abstract":"The ubiquity of location-aware devices and smartphones has unleashed an unprecedented proliferation of location-based services that require processing queries with both spatial and relational predicates. Many algorithms and index structures already exist for processing k-Nearest-Neighbor (kNN, for short) predicates either solely or when combined with textual keyword search. Unfortunately, there has not been enough study on how to efficiently process queries where kNN predicates are combined with general relational predicates, i.e., ones that have selects, joins and group-by's. One major challenge is that because the kNN is a ranking operation, applying a relational predicate before or after a kNN predicate in a query evaluation pipeline (QEP, for short) can result in different outputs, and hence leads to different query semantics. In particular, this renders classical relational query optimization heuristics, e.g., pushing selects below joins, inapplicable. This paper presents various query optimization heuristics for queries that involve combinations of kNN select/join predicates and relational predicates. The proposed optimizations can significantly enhance the performance of these queries while preserving their semantics. Experimental results that are based on queries from the TPC-H benchmark and real spatial data from OpenStreetMap demonstrate that the proposed optimizations can achieve orders of magnitude enhancement in query performance.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"19 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":"128788041","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. Ahmed, Brittany Terese Fasy, Matt Gibson, C. Wenk
{"title":"Choosing thresholds for density-based map construction algorithms","authors":"M. Ahmed, Brittany Terese Fasy, Matt Gibson, C. Wenk","doi":"10.1145/2820783.2820810","DOIUrl":"https://doi.org/10.1145/2820783.2820810","url":null,"abstract":"Due to the ubiquitous use of various positioning technologies in smart phones and other devices, geospatial tracking data has become a routine data source. One of its uses that has gained recent popularity is the construction of street maps from vehicular tracking data. Due to the inherent noise in the data, many map construction algorithms are based on thresholding a density function. While kernel density estimation provides a firm theoretical foundation for computing the density from the measurements, the thresholds are generally picked in a heuristic, and often brute-force way, which results in slow algorithms with no guarantees on the map construction quality. In this paper, we formalize the selection of thresholds in a density-based street map construction algorithm. We propose a new thresholding technique that uses persistent homology combined with statistical analysis to determine a small set of thresholds that captures all relevant topological features. We formally prove that when the samples are drawn uniformly from the street map, a constant number of thresholds suffices to recover the street map. We also provide algorithms to compute the thresholds for different sampling assumptions. Finally, we show the effectiveness of our algorithms in several experiments on artificially generated data and on real GPS trajectory data.","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":"129673100","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}
Jonathan Sun, M. Cieslak, Scott T. Grafton, S. Suri
{"title":"A reeb graph approach to tractography","authors":"Jonathan Sun, M. Cieslak, Scott T. Grafton, S. Suri","doi":"10.1145/2820783.2820848","DOIUrl":"https://doi.org/10.1145/2820783.2820848","url":null,"abstract":"We propose an efficient algorithm for discovering the high-level topological structure of a collection of 3-dimensional trajectories. Our algorithm computes a sparse graph representing the latent \"bundling\" and \"unbundling\" structure of the trajectory data. Our motivation stems from the emerging area of brain tractography, which aims to construct the connectome of human brain white matter fibers. These fibers can be inferred noninvasively using magnetic resonance imaging (MRI) diffusion scans of the brain interior and modeled abstractly as a set of time-independent geometric trajectories in a three-dimensional brain space. Real neuronal fiber pathways exhibit complex but natural bundling structures, which elude existing MRI reconstruction techniques, but are easily captured by our algorithm. We validate our algorithms both theoretically (uniqueness of the graph representation and provably efficient algorithms) and empirically (using both synthetic and real scanned brain data sets).","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"25 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":"124931259","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":"An online marketplace for geosocial data","authors":"Y. Kanza, H. Samet","doi":"10.1145/2820783.2820881","DOIUrl":"https://doi.org/10.1145/2820783.2820881","url":null,"abstract":"When recording their GPS trajectories or posting geo-tagged content on social networks, people produce social spatio-temporal data that can be stored and shared, namely geosocial data. Much of these spatio-temporal data can be used by organizations and applications, for statistical analysis or to provide services that are based on data. By letting people sell the data they produce, to different consumers, both sides can benefit. Thus, we present here a visionary idea of a geosocial marketplace where people and organizations can sell, buy and exchange geosocial data, that is, trade with spatio-temporal data pertaining people. We discuss the involved challenges, such as how to define supply and demand, pricing data, privacy issues and measuring the amount of data being exchanged. We explain the importance of the approach and its applicability. We believe that the proposed vision could motivate followup research in the area of sharing and exchanging spatio-temporal data as well as determining appropriate price points.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"22 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":"122926435","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}
Ruby Y. Tahboub, Jaewoo Shin, Aya Abdelsalam, Jalaleldeen W. Aref, Walid G. Aref, Sunil Prabhakar
{"title":"LIMO: learning programming using interactive map activities","authors":"Ruby Y. Tahboub, Jaewoo Shin, Aya Abdelsalam, Jalaleldeen W. Aref, Walid G. Aref, Sunil Prabhakar","doi":"10.1145/2820783.2820796","DOIUrl":"https://doi.org/10.1145/2820783.2820796","url":null,"abstract":"Advances in geographic information, interactive two- and three-dimensional map visualization accompanied with the proliferation of mobile devices and location data have tremendously benefited the development of geo-educational applications. We demonstrate LIMO; a web-based programming environment that is centered around operations on interactive geographical maps, location-oriented data, and the operations of synthetic objects that move on the maps. LIMO materializes a low-cost open-ended environment that integrates interactive maps and spatial data (e.g., OpenStreetMap). The unique advantage of LIMO is that it relates programming concepts to interactive geographical maps and location data. LIMO offers an environment for students to learn how to program by providing: 1. An easy-to-program library of map and spatial operations, 2. High-quality interactive map graphics, and 3. Example programs that introduce users to writing programs in the LIMO environment.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"67 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":"128936848","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}
Senzhang Wang, Lifang He, Leon Stenneth, Philip S. Yu, Zhoujun Li
{"title":"Citywide traffic congestion estimation with social media","authors":"Senzhang Wang, Lifang He, Leon Stenneth, Philip S. Yu, Zhoujun Li","doi":"10.1145/2820783.2820829","DOIUrl":"https://doi.org/10.1145/2820783.2820829","url":null,"abstract":"Conventional traffic congestion estimation approaches require the deployment of traffic sensors or large-scale probe vehicles. The high cost of deploying and maintaining these equipments largely limits their spatial-temporal coverage. This paper proposes an alternative solution with lower cost and wider spatial coverage by exploring traffic related information from Twitter. By regarding each Twitter user as a traffic monitoring sensor, various real-time traffic information can be collected freely from each corner of the city. However, there are two major challenges for this problem. Firstly, the congestion related information extracted directly from real-time tweets are very sparse due both to the low resolution of geographic location mentioned in the tweets and the inherent sparsity nature of Twitter data. Secondly, the traffic event information coming from Twitter can be multi-typed including congestion, accident, road construction, etc. It is non-trivial to model the potential impacts of diverse traffic events on traffic congestion. We propose to enrich the sparse real-time tweets from two directions: 1) mining the spatial and temporal correlations of the road segments in congestion from historical data, and 2) applying auxiliary information including social events and road features for help. We finally propose a coupled matrix and tensor factorization model to effectively integrate rich information for Citywide Traffic Congestion Eestimation (CTCE). Extensive evaluations on Twitter data and 500 million public passenger buses GPS data on nearly 700 mile roads of Chicago demonstrate the efficiency and effectiveness of the proposed approach.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"69 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":"121935847","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":"Land use classification using convolutional neural networks applied to ground-level images","authors":"Yi Zhu, S. Newsam","doi":"10.1145/2820783.2820851","DOIUrl":"https://doi.org/10.1145/2820783.2820851","url":null,"abstract":"Land use mapping is a fundamental yet challenging task in geographic science. In contrast to land cover mapping, it is generally not possible using overhead imagery. The recent, explosive growth of online geo-referenced photo collections suggests an alternate approach to geographic knowledge discovery. In this work, we present a general framework that uses ground-level images from Flickr for land use mapping. Our approach benefits from several novel aspects. First, we address the nosiness of the online photo collections, such as imprecise geolocation and uneven spatial distribution, by performing location and indoor/outdoor filtering, and semi-supervised dataset augmentation. Our indoor/outdoor classifier achieves state-of-the-art performance on several benchmark datasets and approaches human-level accuracy. Second, we utilize high-level semantic image features extracted using deep learning, specifically convolutional neural networks, which allow us to achieve upwards of 76% accuracy on a challenging eight class land use mapping problem.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"542 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":"123244338","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}
F. Rehman, A. Lbath, Imad Afyouni, Abdullah Murad, Mohamed Abdur Rahman, Bilal Sadiq, Akhlaq Ahmad, Saleh M. Basalamah
{"title":"Semantic multimedia-enhanced spatio-temporal queries in a crowdsourced environment","authors":"F. Rehman, A. Lbath, Imad Afyouni, Abdullah Murad, Mohamed Abdur Rahman, Bilal Sadiq, Akhlaq Ahmad, Saleh M. Basalamah","doi":"10.1145/2820783.2820798","DOIUrl":"https://doi.org/10.1145/2820783.2820798","url":null,"abstract":"Social networks, such as Facebook, Instagram, and Twitter, provide intuitive ways to share a variety of information including geotagged multimedia data within users' communities of interest (COI) or publicly in real-time. Real-time geotagged multimedia data can provide semantics to conventional spatial queries in order to enrich the user navigation experience. In this paper, we introduce a mechanism to process spatio-temporal queries by leveraging geotagged multimedia data such as images, audio, video, and text, in order to add semantics to the conventional queries. Our framework collects, stores, and spatially tags multimedia data shared by users through social networks or through our developed mobile application. The system then uses such data in order to enhance the conventional routing services by resolving existing usability issues and by providing semantics to the routes in terms of enriched points of interest while taking dynamic road conditions into account. A proof of concept of the system will be demonstrated with the following spatio-temporal queries on road networks: 1) multimedia-enhanced shortest path queries; 2) multimedia-enhanced k-nearest neighbor queries; and 3) multimedia-enhanced range queries. Finally, a novel technique for finding lost individuals using geotagged multimedia data is also introduced. The results are tailor-made to the users' smartphone bandwidth and resolution requirements","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"80 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":"121025189","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}