Amgad Madkour, Walid G. Aref, M. Mokbel, Saleh M. Basalamah
{"title":"Geo-tagging non-spatial concepts","authors":"Amgad Madkour, Walid G. Aref, M. Mokbel, Saleh M. Basalamah","doi":"10.1145/2834126.2834138","DOIUrl":"https://doi.org/10.1145/2834126.2834138","url":null,"abstract":"Concept Geo-tagging is the process of assigning a textual identifier that describes a real-world entity to a physical geographic location. A concept can either be a spatial concept where it possesses a spatial presence or be a non-spatial concept where it has no explicit spatial presence. Geo-tagging locations with non-spatial concepts that have no direct relation is a very useful and important operation but is also very challenging. The reason is that, being a non-spatial concept, e.g., crime, makes it hard to geo-tag it. This paper proposes using the semantic information associated with concepts and locations such as the type as a mean for identifying these relations. The co-occurrence of spatial and non-spatial concepts within the same textual resources, e.g., in the web, can be an indicator of a relationship between these spatial and non-spatial concepts. Techniques are presented for learning and modeling relations among spatial and non-spatial concepts from web textual resources. Co-occurring concepts are extracted and modeled as a graph of relations. This graph is used to infer the location types related to a concept. A location type can be a hospital, restaurant, an educational facility and so forth. Due to the immense number of relations that are generated from the extraction process, a semantically-guided query processing algorithm is introduced to prune the graph to the most relevant set of related concepts. For each concept, a set of most relevant types are matched against the location types. Experiments evaluate the proposed algorithm based on its filtering efficiency and the relevance of the discovered relationships. Performance results illustrate how semantically-guided query processing can outperform the baseline in terms of efficiency and relevancy. The proposed approach achieves an average precision of 74% across three different datasets.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"43 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":"124234960","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}
Oleg Batrashev, Amnir Hadachi, Artjom Lind, E. Vainikko
{"title":"Mobility episode detection from CDR's data using switching Kalman filter","authors":"Oleg Batrashev, Amnir Hadachi, Artjom Lind, E. Vainikko","doi":"10.1145/2834126.2834139","DOIUrl":"https://doi.org/10.1145/2834126.2834139","url":null,"abstract":"The detection of stay-jump-and-moving movement episodes using only cellular data is a big challenge due to the nature of the data. In this article, we propose a method to automatically detect the movement episodes (stay-jump-and-moving) from sparsely sampled spatio-temporal data, in our case Call Detail Records (CDRs), using switching Kalman filter with a new integrated movement model and cellular coverage optimization approach. The algorithm is capable of estimating the movement episodes and classifying the trajectory sequences associated to a stay, a jump or a moving action. The result of this approach can be beneficial for applications using cellular data related to traffic management, mobility profiling, and semantic enrichment.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"44 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":"130422739","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 energy-conserving algorithm for the collection and reporting of data in mobile sensor networks","authors":"Matthew Horak, Shayma Alkobaisi, Wan D. Bae","doi":"10.1145/2834126.2834130","DOIUrl":"https://doi.org/10.1145/2834126.2834130","url":null,"abstract":"Advances in mobile and sensor technologies have enabled the collection of continuously changing data such as locations and weather measurements. However, conserving the energy of these devices has been a major challenge. In this work, we propose an energy-efficient solution to a new variant of the Discrete Unit Disk Covering Problem (DUDC), which models a mobile sensor network. We present an approximation algorithm for this problem and theoretical analysis in the case of randomly positioned sensors that shows that three objectives are met: reduce the average number of active sensors that report measurements, spread the measurement burden over time evenly among the reporting sensors and maintain an acceptable quality of the reported measurements. Experimental and theoretical results show that our proposed algorithm has computational complexity and approximation factor comparable to currently known deterministic algorithms while meeting the aforementioned objectives.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"07 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":"131124289","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}
C. Silvestri, Francesco Cagnin, Francesco Lettich, S. Orlando, M. Wachowicz
{"title":"Mining condensed spatial co-location patterns","authors":"C. Silvestri, Francesco Cagnin, Francesco Lettich, S. Orlando, M. Wachowicz","doi":"10.1145/2834126.2834135","DOIUrl":"https://doi.org/10.1145/2834126.2834135","url":null,"abstract":"The discovery of co-location patterns among spatial events is an important task in spatial data mining. We introduce a new kind of spatial co-location patterns, named condensed spatial co-location patterns, that can be considered as a lossy compressed representation of all the co-location patterns. Each condensed pattern is the representative, and a superset, of a group of spatial co-location patterns in the full set of patterns such that the difference between the interestingness measure of the representative and the measures of the patterns belonging to the associated group are negligible. Our preliminary experiments show that condensed spatial co-location patterns are less sensitive to parameter changes and more robust in presence of missing data than closed spatial co-location patterns.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"322 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997995","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}
Riccardo Guidotti, R. Trasarti, M. Nanni, F. Giannotti
{"title":"Towards user-centric data management: individual mobility analytics for collective services","authors":"Riccardo Guidotti, R. Trasarti, M. Nanni, F. Giannotti","doi":"10.1145/2834126.2834132","DOIUrl":"https://doi.org/10.1145/2834126.2834132","url":null,"abstract":"We are under the big data microscope, and our digital traces are an inestimable source of awareness to deeply understand mobility phenomena as well as economic trends, social relationships and so on. Setting the focus of the big data microscope to capture human systematic behavior is surely a promising direction. The proposed vision is a methodological framework aimed to deal with intelligent personal data store that are able to automatically perform individual data mining, and that can provide proactive suggestions and support decisions, allow to share individual profiles in order to reach a level of knowledge comparable to those belonged to a collective system, and suggest interactions between individual and collective data mining in order to overtake the level of complex society knowledge extracted by the state-of-art methods. The study of individuals profiles, and the comparison and interactions with collective patterns, is dramatically helpful both for the novel detailed information retrieved through the methodological framework and for the possibility to deal at the same time with privacy issues.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"134 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":"116348622","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}
Saranya Sadasivam, A. Baba, Wei-Shinn Ku, Haiquan Chen
{"title":"A2N2: approximate aggregate nearest neighbor queries on road networks","authors":"Saranya Sadasivam, A. Baba, Wei-Shinn Ku, Haiquan Chen","doi":"10.1145/2834126.2834819","DOIUrl":"https://doi.org/10.1145/2834126.2834819","url":null,"abstract":"Aggregate nearest neighbor queries return a point with a minimum net distance from a set of query points. Consider, for example, group of friends located at specific locations (query points) that want to meet at a restaurant (a point) such that they travel the minimum sum of distances in order to meet. In this paper, we proposed a fast algorithm, A2N2, to answer such aggregate nearest neighbor queries on road networks based on pre-computation. An assortment of optimized data structures and techniques are used so as to reduce the overall computation time. Additionally, by focusing on reducing the amount of pre-computed data stored and using efficient ways to retrieve and use them during query time, the algorithm is computationally faster at the cost of being minimally approximate. Experiments on real road network data sets demonstrate the impact of input parameters on the query processing time and supports the claim. It was observed that the pre-computation time and query processing time for A2N2 was respectively in the orders of up to 1000 and 100 times faster than that of a Voronoi based ANN approach. The minimum normalized path distance deviation across all data sets for A2N2 was only 2% with the computed path distances comparable to a Voronoi based approach.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"15 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":"121328626","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":"Querying semantic trajectory episodes","authors":"T. P. Nogueira, H. Martin","doi":"10.1145/2834126.2834136","DOIUrl":"https://doi.org/10.1145/2834126.2834136","url":null,"abstract":"Trajectory acquisition, management, and processing are important tasks for any application that deals with spatiotemporal data. In order to perform these tasks effectively, it is important to rely on flexible structures. Many data models have been proposed for representing spatiotemporal traces. However, modeling trajectory characteristics and context information is still a challenge. In this work, we introduce the STEP ontology (Semantic Trajectory Episodes) for trajectory enrichment. In order to model this domain, we structure trajectories and related contextual data in terms of semantic episodes that allow describing various characteristics of the traces and context along time and space dimensions. We demonstrate the usage of the STEP ontology for enriching raw trajectories and show how the proposed model may be useful for trajectory analysis tasks.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile 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":"129523159","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. Belussi, S. Migliorini, Mauro Negri, G. Pelagatti
{"title":"Validation of spatial integrity constraints in city models","authors":"A. Belussi, S. Migliorini, Mauro Negri, G. Pelagatti","doi":"10.1145/2834126.2834137","DOIUrl":"https://doi.org/10.1145/2834126.2834137","url":null,"abstract":"Several different models have been defined in literature for the definition of 3D city models, from CityGML [14] to Inspire [8]. Such models include a geometrical representation of features together with a semantical classification of them. The semantical characterization of objects encapsulates important meaning and relations which are defined only implicitly or through natural language, such as a window surface shall be contained in the building boundary. The problem of ensuring the coherence between geometric and semantic information is well known in literature. Many attempts exist which try to extent the OCL language in order to represent spatial constraints for an UML model. However, this approach requires a deep knowledge of the OCL language and the implementation of ad-hoc procedures for the validation of the defined constraints. The aim of this paper is the development of a set of templates for expressing spatial 3D constraints between features which does not require any particular knowledge of a formal language. Moreover, the constraints instantiated from these templates can be automatically translated into validation procedures.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"13 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":"128509989","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":"Scalable selective traffic congestion notification","authors":"Gyözö Gidófalvi","doi":"10.1145/2834126.2834134","DOIUrl":"https://doi.org/10.1145/2834126.2834134","url":null,"abstract":"Congestion is a major problem in most metropolitan areas. Systems that can in a timely manner inform drivers about relevant, current or predicted traffic congestion are paramount for effective traffic management. Without loss of generality, this paper proposes such a system that by adopting a grid-based discretization of space, can flexibly scale the computation cost and the geographic level of detail of traffic information that it provides. From the continuous stream of grid-based position and speed reports from vehicles, the system incrementally derives 1) statistics for detecting directional traffic congestions and 2) model parameters for a time-inhomogeneous, Markov jump process that is used to predict the likelihood that a given vehicle will encounter a detected directional congestion within the notification horizon. A simple but efficient SQL-based prototype implementation of the system that can naturally be ported to Big Data processing frameworks is also explained in detail. Empirical evaluations on millions of object trajectories show that 1) the proposed movement model captures the topology of the underlying road network space and the directional aspects of movement on it, 2) the congestion notification accuracy of the system is superior to a linear movement model based system, and 3) the prototype implementation of the system (i) scales linearly with its input load, notification horizon and spatio-temporal resolution and (ii) can in real-time process 1.14 million object trajectories.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile 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":"133882741","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":"Distributed autonomous GIS to form teams for public safety","authors":"R. Nourjou, J. Gelernter","doi":"10.1145/2834126.2834133","DOIUrl":"https://doi.org/10.1145/2834126.2834133","url":null,"abstract":"Public safety requires emergency response that is timely and efficient. This paper describes how to distribute the emergency call among those in the area so as to optimize their locations when called, and their expertise. The call will route to the next most qualified if those in the immediate vicinity cannot come. We describe the system architecture and provide the algorithmic rules, as well as sketch an interface and propose how the completed system could be evaluated.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"21 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":"128570707","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}