Tourismo: A User-Preference Tourist Trip Search Engine
In this demonstration we re-visit the problem of finding an optimal route from location A to B. Currently, navigation systems compute shortest, fastest, most economic routes or any combination thereof. More often than not users want to consider “soft” qualitative metrics such as popularity, scenic value, and general appeal of a route. Routing algorithms have not (yet) been able to appreciate, measure, and evaluate such qualitative measures. Given the emergence of user-generated content, data exists that records user preference. This work exploits user-generated data, including image data, text data and trajectory data, to estimate the attractiveness of parts of the spatial network in relation to a particular user. We enrich the spatial network dataset by quantitative scores reflecting qualitative attractiveness. These scores are derived from a user-specific self-assessment (“On vacation I am interested in: family entertainment, cultural activities, exotic food”) and the selection of a respective subset of existing POIs. Using the enriched network, our demonstrator allows to perform a bicriterion optimal path search, which optimizes both travel time as well as the attractiveness of the route. Users will be able to choose from a whole skyline of alternative routes based on their preference. A chosen route will also be illustrated using user-generated data, such as images, textual narrative, and trajectories, i.e., data that showcase attractiveness and hopefully lead to a perfect trip.
KeywordsRoad Network Trajectory Data Spatial Network Path Query Route Search
This research has received funding from the Shared E-Fleet project (in the IKTII program) by the BMWi (grant no. 01ME12107), from the DFG (grant no. RE 266/5-1), from the DAAD supported by the BMBF (grant no. 57052426). Dieter Pfoser has been partially supported by NGA NURI (grant no. HM02101410004).
- 1.Andersen, O., Jensen, C.S., Torp, K., Yang, B.: Ecotour: reducing the environmental footprint of vehicles using eco-routes. In: MDM, pp. 338–340 (2013)Google Scholar
- 2.Graf, F., Kriegel, H.-P., Renz, M., Schubert, M.: MARiO: multi-attribute routing in open street map. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 486–490. Springer, Heidelberg (2011)Google Scholar
- 3.Shekelyan, M., Jossé, G., Schubert, M.: Linear path skylines in multicriteria networks. In: ICDE 2015, pp. 459–470 (2015)Google Scholar
- 4.Shekelyan, M., Jossé, G., Schubert, M.: Paretoprep: efficient lower bounds for path skylines and fast path computation. In: SSTD 2015 (2015)Google Scholar
- 5.Jossé, G., Franzke, M., Skoumas, G., Züfle, A., Nascimento, M.A., Renz, M.: A framework for computation of popular paths from crowdsourced data. In: ICDE, pp. 1428–1431 (2015)Google Scholar
- 6.Sacharidis, D., Bouros, P.: Routing directions: keeping it fast and simple. In: ACM SIGSPATIAL GIS, pp. 164–173 (2013)Google Scholar
- 7.Westphal, M., Renz, J.: Evaluating and minimizing ambiguities in qualitative route instructions. In: ACM SIGSPATIAL GIS, pp. 171–180 (2011)Google Scholar
- 10.Kanza, Y., Safra, E., Sagiv, Y., Doytsher, Y.: Heuristic algorithms for route-search queries over geographical data. In: ACM SIGSPATIAL GIS, p. 11 (2008)Google Scholar
- 12.Quercia, D., Schifanella, R., Aiello, L.M.: The shortest path to happiness: Recommending beautiful, quiet, and happy routes in the city. In: CoRR (abs/1407.1031) (2014)Google Scholar
- 13.Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: ICDE, pp. 900–911 (2011)Google Scholar
- 14.Newson, P., Krumm, J.: Hidden markov map matching through noise and sparseness. In: ACM SIGSPATIAL GIS, pp. 336–343 (2009)Google Scholar