Budget and Experience Based Travel Planner Using Collaborative Filtering

Gokul Krishna M, M. Haseeb, Mohammed Siyad B, P.A Mohamed Zameel, S. Raj
{"title":"Budget and Experience Based Travel Planner Using Collaborative Filtering","authors":"Gokul Krishna M, M. Haseeb, Mohammed Siyad B, P.A Mohamed Zameel, S. Raj","doi":"10.1109/ODICON50556.2021.9428978","DOIUrl":null,"url":null,"abstract":"Travellers in the modern era face many challenges. Budget and time are the major constraints for a traveller. So a good travel plan should be satisfying these constraints and provide maximum enjoyment to the traveller. The proposed ‘Budget and Experience-based Travel Planner’ allows a traveller to create a travel plan that satisfies the above-mentioned constraints as well as other factors such as the experience of the traveller. The collected data from different sources are filtered and places that have missing fields that are relevant such as tags, district, coordinates, rating, reviews, etc are removed along with places having irrelevant tags. After filtering, the database contains over 600 destinations with 77 unique tags. Using suitable machine learning algorithms considering the constraints, the recommendation engine recommends places. We have created a routing algorithm which minimizes the distance covered to reach the different destinations considering the various cases that could happen. Suitable algorithms are used for scheduling the travel itinerary. The time, budget and destination are provided by the user and a suitable travel plan is provided back to the user.","PeriodicalId":197132,"journal":{"name":"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ODICON50556.2021.9428978","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Travellers in the modern era face many challenges. Budget and time are the major constraints for a traveller. So a good travel plan should be satisfying these constraints and provide maximum enjoyment to the traveller. The proposed ‘Budget and Experience-based Travel Planner’ allows a traveller to create a travel plan that satisfies the above-mentioned constraints as well as other factors such as the experience of the traveller. The collected data from different sources are filtered and places that have missing fields that are relevant such as tags, district, coordinates, rating, reviews, etc are removed along with places having irrelevant tags. After filtering, the database contains over 600 destinations with 77 unique tags. Using suitable machine learning algorithms considering the constraints, the recommendation engine recommends places. We have created a routing algorithm which minimizes the distance covered to reach the different destinations considering the various cases that could happen. Suitable algorithms are used for scheduling the travel itinerary. The time, budget and destination are provided by the user and a suitable travel plan is provided back to the user.
使用协同过滤的基于预算和经验的旅行计划器
现代的旅行者面临着许多挑战。预算和时间是旅行者的主要限制因素。因此,一个好的旅行计划应该满足这些限制,并为旅行者提供最大的乐趣。拟议的“基于预算和体验的旅行计划”允许旅行者创建满足上述限制以及其他因素(如旅行者的经验)的旅行计划。从不同来源收集的数据会被过滤,缺少相关字段(如标签、地区、坐标、评级、评论等)的地方会被删除,同时删除不相关标签的地方。经过过滤,数据库包含超过600个目的地和77个唯一标签。考虑到约束条件,使用合适的机器学习算法,推荐引擎推荐地点。考虑到可能发生的各种情况,我们创建了一种路由算法,可以最大限度地减少到达不同目的地所覆盖的距离。采用合适的算法来安排旅行行程。用户提供时间、预算和目的地,并向用户提供合适的旅行计划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信