Answers are grounded in this paper and cite their sources.
In resource planning scenarios, reverseknearest neighbor search plays an important role. However, the existing reverseknearest neighbor search on trajectories only supports spatial features of trajectories. In this article, we introduce reverseknearest neighbors query on semantic trajectories (RkNNST). Given a query point from a set of geo-textual objects (e.g., POIs), the query finds those trajectories that take this query point as one of theirknearest geo-textual correlative objects. To efficiently answer RkNNST queries, we propose a novel index IMC-tree, which organizes the global and local geo-textual information on semantic trajectories. A branch-and-bound search algorithm DOTA is then designed to traverse IMC-tree with various pruning rules. To speed up the computation of correlative distance, we also design an inverted-file-based algorithm to compute without enumerating all combinations of geo-textual objects. Experiments on a real dataset validate the effectiveness and efficiency of our proposed algorithms.
No takes yet. Share an insight, caveat, or question.
Pan et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: