Route Search over Probabilistic Geospatial Data

Kanza, Yaron; Safra, Eliyahu; Sagiv, Yehoshua

doi:10.1007/978-3-642-02982-0_12

Cited by 20 publications

(26 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Earlier works on route-search queries dealt either with non-probabilistic datasets (e.g., [1,3,7,8,9]), or with the non-interactive version of the problem (e.g., [5,6]). Those results cannot be used to solve the interactive route-search problem that we address in this paper, since they are not designed to take user feedback into account.…”

Section: Related Workmentioning

confidence: 99%

“…Answering route-search queries is traditionally done by computing a complete route, from s to t, that has a high probability-of-success and a short length [5]. An interactive search is different from the traditional approach in the following aspect.…”

Section: Interactive Searchmentioning

confidence: 99%

“…The other goal is that the route will go via objects that have the highest possible probabilities of satisfying the user needs. Semantics and algorithms for route search over probabilistic data were studied in a previous work [5]. This paper deals with interactive route search.…”

Section: Introductionmentioning

confidence: 99%

“…In the non-interactive case, the problem is NP-hard [5]. The interactive case is difficult as well for the following reason.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Interactive route search in the presence of order constraints

et al. 2010

Self Cite

View full text Add to dashboard Cite

A route search is an enhancement of an ordinary geographic search. Instead of merely returning a set of entities, the result is a route that goes via entities that are relevant to the search. The input to the problem consists of several search queries, and each query defines a type of geographical entities. When visited, some of the entities succeed in satisfying the user while others fail to do so; however, only the probability of success is known prior to arrival. The main task is to find a route that visits at least one satisfying entity of each type. In an interactive search, the route is computed in steps. In each step, only the next entity of the route is given to the user, and after visiting that entity, the user provides a feedback specifying whether the entity satisfies her. This paper investigates interactive route search in the presence of order constraints that specify that some types of entities should be visited before others. We present heuristic algorithms for interactive route search for two cases, depending on whether the constraints define a complete order or a partial one. The main challenge is to utilize the feedback in order to compute a route that is shorter and has a higher degree of success, compared to routes that are computed non-interactively. We also discuss how to compare the results of the algorithms and introduce suitable measures for doing so. Experiments on real-world data illustrate the efficiency and effectiveness of our algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Interactive Searchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…In the non-interactive case, the problem is NP-hard [5]. The interactive case is difficult as well for the following reason.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Interactive route search in the presence of order constraints

et al. 2010

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, the desire to have the shortest possible route conflicts with the necessity to guarantee a high probability of satisfying the user's needs. Semantics and algorithms for route search over probabilistic data were investigated in earlier work [3].…”

Section: Introductionmentioning

confidence: 99%

An interactive approach to route search

Kanza¹,

Levin²,

Safra³

et al. 2009

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Self Cite

View full text Add to dashboard Cite

In a probabilistic route search, there is a start location, a target location, and search queries Q1, . . . , Qn. Each Qi has an answer set Ai consisting of geo-spatial objects and their probabilities. The probability of an object o ∈ Ai specifies the likelihood that o satisfies Qi. The goal is to compute a route that is short and yet has a high probability of satisfying all the Qi. This paper investigates interactive route search. Upon arrival at each object, the user provides feedback specifying whether the object satisfies its corresponding query. The goal is to compute the next object to be visited, based on the feedback. Several heuristic algorithms are given and compared experimentally.

show abstract

Location- and keyword-based querying of geo-textual data: a survey

2021

View full text Add to dashboard Cite

With the broad adoption of mobile devices, notably smartphones, keyword-based search for content has seen increasing use by mobile users, who are often interested in content related to their geographical location. We have also witnessed a proliferation of geo-textual content that encompasses both textual and geographical information. Examples include geo-tagged microblog posts, yellow pages, and web pages related to entities with physical locations. Over the past decade, substantial research has been conducted on integrating location into keyword-based querying of geo-textual content in settings where the underlying data is assumed to be either relatively static or is assumed to stream into a system that maintains a set of continuous queries. This paper offers a survey of both the research problems studied and the solutions proposed in these two settings. As such, it aims to offer the reader a first understanding of key concepts and techniques, and

show abstract

Route Search over Probabilistic Geospatial Data

Cited by 20 publications

References 17 publications

Interactive route search in the presence of order constraints

Interactive route search in the presence of order constraints

An interactive approach to route search

Location- and keyword-based querying of geo-textual data: a survey

Contact Info

Product

Resources

About