Please use this identifier to cite or link to this item:
|Title:||Group location selection queries over uncertain objects|
Group location selection
|Citation:||Xu, C., Gu, Y., Zimmermann, R., Lin, S., Yu, G. (2013). Group location selection queries over uncertain objects. IEEE Transactions on Knowledge and Data Engineering 25 (12) : 2796-2808. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2012.160|
|Abstract:||Given a set of spatial objects, facilities can influence the objects located within their influence regions that are represented by circular disks with the same radius γ. Our task is to select the minimum number of locations such that establishing a temporary facility at each selected location would ensure that all the objects are influenced. Aiming to solve this location selection problem, we propose a novel kind of location selection query, called group location selection (GLS) queries. In many real-world applications, every object is usually located within an uncertainty region instead of at an exact point. Due to the uncertainty of the data, GLS processing needs to ensure that the probability of each uncertain object being influenced by one facility is not less than a given threshold τ. An analysis of the time cost reveals that it is infeasible to exactly answer GLS queries over uncertain objects in polynomial time. Hence, this paper proposes an approximate query framework for answering queries efficiently while guaranteeing that the results of GLS queries are correct with a bounded probability. The performance of the proposed methods of the framework is demonstrated by theoretical analysis and extensive experiments with both real and synthetic data sets. © 1989-2012 IEEE.|
|Source Title:||IEEE Transactions on Knowledge and Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2018
WEB OF SCIENCETM
checked on Oct 10, 2018
checked on Oct 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.