Igo Brilhante
Franco Maria Nardini
Raffaele Perego
Abstract
We present an application where semantically enriched trajectories obtained from crowdsensed data are used to build an advanced system for planning personalized sightseeing tours, called TripBuilder. The interesting feature of TripBuilder is that it uses Wikipedia content and trajectories of previous tourists collected by georeferenced Flickr photos in a complex spatio-temporal framework. The objective is to address, in an unsupervised way, the problem of suggesting a budgeted sightseeing tour based on the preferences of the tourist and the time available for the visit. We present few highlights of how TripBuilder works along with a research agenda where we discuss the role of semantically enriched trajectories and crowdsourced location data in planning itineraries.
- I. R. Brilhante, J. A. Macedo, F. M. Nardini, R. Perego, and C. Renso. Where shall we go today?: Planning touristic tours with tripbuilder. In Proceedings of the 22nd ACM International Conference on Conference on Information and Knowledge Management, CIKM 2013, pages 757--762, New York, NY, USA, 2013. ACM. Google Scholar
Digital Library
- I. R. Brilhante, J. A. Macedo, F. M. Nardini, R. Perego, and C. Renso. Tripbuilder: A tool for recommending sightseeing tours. In M. Rijke, T. Kenter, A. P. Vries, C. X. Zhai, F. Jong, K. Radinsky, and K. Hofmann, editors, Advances in Information Retrieval, volume 8416 of Lecture Notes in Computer Science, pages 771--774. Springer International Publishing, 2014.Google Scholar
- I. R. Brilhante, J. A. Macedo, F. M. Nardini, R. Perego, and C. Renso. On planning sightseeing tours with tripbuilder. Information Processing & Management, 51(2):1--15, 2015.Google ScholarCross Ref
- R. Cohen and L. Katzir. The generalized maximum coverage problem. Information Processing Letters, 108(1):15--22, 2008. Google ScholarDigital Library
- M. Ester, H. peter Kriegel, J. S, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. pages 226--231. AAAI Press, 1996.Google ScholarDigital Library
- S. S. Rajesh Matai and M. L. Mittal. Traveling salesman problem: an overview of applications, formulations, and solution approaches, traveling salesman problem, theory and applications. In Traveling Salesman Problem, Theory and Applications. InTech, 2010.Google Scholar
Index Terms
- Planning sightseeing tours using crowdsensed trajectories
Recommendations
A city guide agent creating and adapting individual sightseeing tours
ISDA '05: Proceedings of the 5th International Conference on Intelligent Systems Design and ApplicationsTourists deciding to explore a destination spontaneously and unprepared will have to walk and search on their own. This kind of investigation can be very uncomfortable as it often ends up in disarrangement. With today's agent technology, tourists can ...
Interactive Trip Planning Using Activity Trajectories
ADCS '16: Proceedings of the 21st Australasian Document Computing SymposiumWe present an interactive trip planning system called @FINDER which uses an exemplar trajectory query to find the most related top-k spatial-textual trajectories. @FINDER is implemented to support various degrees of user information needs for trip ...
Generalized knight's tours on rectangular chessboards
In [Math. Mag. 64 (1991) 325-332], Schwenk has completely determined the set of all integers m and n for which the mxn chessboard admits a closed knight's tour. In this paper, (i) we consider the corresponding problem with the knight's move generalized ...
Comments