Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems最新文献

筛选

英文中文

Fusion of uncertain location data from heterogeneous sources 异构源不确定位置数据的融合

Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2834126.2834818

Goce Trajcevski

{"title":"Fusion of uncertain location data from heterogeneous sources","authors":"Goce Trajcevski","doi":"10.1145/2834126.2834818","DOIUrl":"https://doi.org/10.1145/2834126.2834818","url":null,"abstract":"Many applications of high societal relevance -- e.g., transportation and traffic management, disaster remediation, location-aware social networking, (tourist) recommendation systems, military logistics (to name but a few) -- rely on some kind of Location Based Services (LBS). The crucial components to support such services, in turn, rely on efficient techniques for managing the data capturing the information pertaining to the whereabouts in time of the moving entities -- storing, retrieving and querying such data. Traditionally, such topics were subjects of the fields called Spatial/Spatio-Temporal Databases, Moving Objects Databases (MOD) and Geographic Information Systems (GIS) [2, 5, 11]. To give an intuitive idea about the magnitude -- according to Mc Kinsey survey from 2011 [9], the volume of location-in-time data exceeds the order of Peta-Bytes per year just from smartphones -- and this is only the \"pure\" GPS (Global Positioning System) data. Including the cell-towers location data would boost the size by two orders of magnitude -- however, this is not even close to the full magnitude of the variety of location-related data contained in numerous tweets and other social networks based communications (which is of interest for applications such as behavioral marketing).","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"29 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":"116912457","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}

引用次数: 0

Aggregate k-nearest neighbors queries in time-dependent road networks 时变路网中k近邻查询的聚合

Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems Pub Date : 2012-09-27 DOI: 10.1145/2834126.2834129

L. A. Cruz, M. Nascimento, J. Macêdo

{"title":"Aggregate k-nearest neighbors queries in time-dependent road networks","authors":"L. A. Cruz, M. Nascimento, J. Macêdo","doi":"10.1145/2834126.2834129","DOIUrl":"https://doi.org/10.1145/2834126.2834129","url":null,"abstract":"In this paper we present an algorithm for processing aggregate nearest neighbor queries in time-dependent road networks, i.e., given a road network where the travel time over an edge is time-dependent, a set of query points Q, a set of points of interest (POIs) P and an aggregate function (e.g., sum), we find the k POIs that minimize the aggregated travel time from the query points. For instance, considering a city's road network at a given departure time and a group of friends at different locations wishing to meet at a restaurant, the time-dependent aggregate nearest neighbor query, considering the sum function, would return the restaurant that minimizes the sum of all travel times to it. The main contribution of our work is the consideration of the time-dependency of the network, a realistic characteristic of urban road networks, which has not been considered previously when addressing aggregate nearest neighbor queries. Our approach is based on the ANNQPLB algorithm proposed by Htoo et al. and uses Hub Labels, proposed by Abraham et al., to compute optimistic travel times efficiently. In order to compare our proposal we extended the previously proposed ANNQPLB algorithm aimed at non-time dependent aggregate nearest neighbor queries, enabling it to deal with the time-dependency. Our experiments using a real road network have shown our proposed solution to be up to 94% faster than the temporally extended previous solution.","PeriodicalId":194029,"journal":{"name":"Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134330684","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}

引用次数: 29

Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems 第四届ACM SIGSPATIAL移动地理信息系统国际研讨会论文集

Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems Pub Date : 1900-01-01 DOI: 10.1145/2834126

引用次数: 0

首页上一页