Multiple days trip recommendation based on check-in data

Heng Ching Liao, Yi Chung Chen, Chiang Lee

研究成果: Conference contribution

摘要

A travel recommender system can generate suggested itineraries for users based on their preferences. However, current systems are not capable of simultaneously considering trip length, distance, user requirements and preferences when making recommendations, being only equipped to consider one or two of these variables at one time. Also, to generate recommendations the system must process all attractions in the database, requiring more data access and longer processing time. We analyzed the check-in records of users and utilized a new concept of time intervals combined with a multiple days trip algorithm to produce itineraries compatible with the interests and needs of users. By applying R-tree to the travel recommender system, we reduced data access times and computation time. Lastly, we propose a trip evaluator equation that can be used to compare the strengths and weaknesses of each algorithm. Experimental results verified the effectiveness of our method.

原文English
主出版物標題Multidisciplinary Social Networks Research - 2nd International Conference, MISNC 2015, Proceedings
編輯Kai Wang, Shiro Uesugi, Leon Wang, Koji Okuhara, I-Hsien Ting
發行者Springer Verlag
頁面316-330
頁數15
ISBN(列印)9783662483183
DOIs
出版狀態Published - 2015
事件2nd International Conference on Multidisciplinary Social Networks Research, MISNC 2015 - Matsuyama, Japan
持續時間: 2015 9月 12015 9月 3

出版系列

名字Communications in Computer and Information Science
540
ISSN(列印)1865-0929

Other

Other2nd International Conference on Multidisciplinary Social Networks Research, MISNC 2015
國家/地區Japan
城市Matsuyama
期間15-09-0115-09-03

All Science Journal Classification (ASJC) codes

  • 一般電腦科學
  • 一般數學

指紋

深入研究「Multiple days trip recommendation based on check-in data」主題。共同形成了獨特的指紋。

引用此