基于链接开放数据的旅行推荐方法

Nasredine Cheniki, Marwa Boulakbech, Hamza Labbaci, Yacine Sam, Nizar Messai, T. Devogele
{"title":"基于链接开放数据的旅行推荐方法","authors":"Nasredine Cheniki, Marwa Boulakbech, Hamza Labbaci, Yacine Sam, Nizar Messai, T. Devogele","doi":"10.1109/WETICE.2019.00048","DOIUrl":null,"url":null,"abstract":"A huge amount of Tourism information is provided through myriad Web services. Travelers who want to plan their trips have to sift through a large pool of Web services before figuring out the best itinerary of places to visit. Such a process gets even more tedious when travelers need to satisfy specific constraints such as visit time and price. In this paper, we propose a linked open data (LOD) service recommendation approach to help travelers plan their trips (i.e., a sequence of places to visit) given a set of preferences and constraints. The proposed approach runs a three-step process. The first step consists of annotating a set of touristic Web services with LOD resources that describe their capabilities. The second step matches user constraints and preferences with Web service provided touristic information and returns a pre-list of itineraries. The third step runs a LOD-based matching between services to improve trips recommendation. Experiments conducted on real data show promising results.","PeriodicalId":116875,"journal":{"name":"2019 IEEE 28th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Linked Open Data Based Approach for Trip Recommendation\",\"authors\":\"Nasredine Cheniki, Marwa Boulakbech, Hamza Labbaci, Yacine Sam, Nizar Messai, T. Devogele\",\"doi\":\"10.1109/WETICE.2019.00048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A huge amount of Tourism information is provided through myriad Web services. Travelers who want to plan their trips have to sift through a large pool of Web services before figuring out the best itinerary of places to visit. Such a process gets even more tedious when travelers need to satisfy specific constraints such as visit time and price. In this paper, we propose a linked open data (LOD) service recommendation approach to help travelers plan their trips (i.e., a sequence of places to visit) given a set of preferences and constraints. The proposed approach runs a three-step process. The first step consists of annotating a set of touristic Web services with LOD resources that describe their capabilities. The second step matches user constraints and preferences with Web service provided touristic information and returns a pre-list of itineraries. The third step runs a LOD-based matching between services to improve trips recommendation. Experiments conducted on real data show promising results.\",\"PeriodicalId\":116875,\"journal\":{\"name\":\"2019 IEEE 28th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 28th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WETICE.2019.00048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 28th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WETICE.2019.00048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

大量的旅游信息通过无数的网络服务提供。想要计划旅行的旅行者必须在大量的网络服务中筛选,才能确定最佳的旅游路线。当旅行者需要满足旅行时间和价格等特定限制时,这个过程就会变得更加繁琐。在本文中,我们提出了一种链接开放数据(LOD)服务推荐方法,以帮助旅行者在给定一组偏好和约束的情况下计划他们的旅行(即一系列要访问的地方)。提议的方法分为三个步骤。第一步包括用描述其功能的LOD资源注释一组旅游Web服务。第二步将用户约束和首选项与Web服务提供的旅游信息进行匹配,并返回行程的预先列表。第三步在服务之间运行基于lod的匹配,以改进行程推荐。在实际数据上进行的实验显示出令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Linked Open Data Based Approach for Trip Recommendation
A huge amount of Tourism information is provided through myriad Web services. Travelers who want to plan their trips have to sift through a large pool of Web services before figuring out the best itinerary of places to visit. Such a process gets even more tedious when travelers need to satisfy specific constraints such as visit time and price. In this paper, we propose a linked open data (LOD) service recommendation approach to help travelers plan their trips (i.e., a sequence of places to visit) given a set of preferences and constraints. The proposed approach runs a three-step process. The first step consists of annotating a set of touristic Web services with LOD resources that describe their capabilities. The second step matches user constraints and preferences with Web service provided touristic information and returns a pre-list of itineraries. The third step runs a LOD-based matching between services to improve trips recommendation. Experiments conducted on real data show promising results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信