Probabilistic Convex Hull Queries over Uncertain Data
| Autor: | Da Yan, Zhou Zhao, Steven Liu, Wilfred Ng |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Convex hull
Mathematical optimization Uncertain data Computer science Proper convex function Approximation algorithm Convex polygon Computer Science Applications Computational Theory and Mathematics Output-sensitive algorithm Convex combination Gift wrapping algorithm Time complexity Information Systems |
| Zdroj: | IEEE Transactions on Knowledge and Data Engineering. 27:852-865 |
| ISSN: | 1041-4347 |
| DOI: | 10.1109/tkde.2014.2340408 |
| Popis: | The convex hull of a set of two-dimensional points, $P$ , is the minimal convex polygon that contains all the points in $P$ . Convex hull is important in many applications such as GIS, statistical analysis and data mining. Due to the ubiquity of data uncertainty such as location uncertainty in real-world applications, we study the concept of convex hull over uncertain data in 2D space. We propose the Probabilistic Convex Hull (PCH) query and demonstrate its applications, such as Flickr landscape photo extraction and activity region visualization, where location uncertainty is incurred by GPS devices or sensors. To tackle the problem of possible world explosion, we develop an $O(N^3)$ algorithm based on geometric properties, where $N$ is the data size. We further improve this algorithm with spatial indices and effective pruning techniques, which prune the majority of data instances. To achieve better time complexity, we propose another $O(N^2\,\log\, N)$ algorithm, by maintaining a probability oracle in the form of a circular array with nice properties. Finally, to support applications that require fast response, we develop a Gibbs-sampling-based approximation algorithm which efficiently finds the PCH with high accuracy. Extensive experiments are conducted to verify the efficiency of our algorithms for answering PCH queries. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|