数据挖掘在流行旅游套餐设计中的应用

B. Al-Salim
{"title":"数据挖掘在流行旅游套餐设计中的应用","authors":"B. Al-Salim","doi":"10.1109/EIT.2005.1627017","DOIUrl":null,"url":null,"abstract":"We developed a strategy to design a travel package with the most popular and appropriate elements for the traveler; at the same time, this strategy minimizes the operation and processing costs of the travel agency. Association rules as a data mining technique is implemented to develop this model. We rely on the available massive travel agency database to make essential decisions related to the optimality of designing the travel package. A heuristic algorithm is an approach used to solve the final model. An illustrative numerical example based on a made-up data set is also provided","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Data mining application in designing popular and optimal travel packages\",\"authors\":\"B. Al-Salim\",\"doi\":\"10.1109/EIT.2005.1627017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We developed a strategy to design a travel package with the most popular and appropriate elements for the traveler; at the same time, this strategy minimizes the operation and processing costs of the travel agency. Association rules as a data mining technique is implemented to develop this model. We rely on the available massive travel agency database to make essential decisions related to the optimality of designing the travel package. A heuristic algorithm is an approach used to solve the final model. An illustrative numerical example based on a made-up data set is also provided\",\"PeriodicalId\":358002,\"journal\":{\"name\":\"2005 IEEE International Conference on Electro Information Technology\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE International Conference on Electro Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2005.1627017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE International Conference on Electro Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2005.1627017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们制定了一个策略,为旅行者设计一个最受欢迎和最合适的旅行套餐;同时,这种策略最大限度地降低了旅行社的运营和加工成本。将关联规则作为一种数据挖掘技术来开发该模型。我们依靠现有的大量旅行社数据库来做出与旅游套餐设计最优相关的重要决策。启发式算法是一种用于求解最终模型的方法。还提供了一个基于虚构数据集的说明性数值示例
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data mining application in designing popular and optimal travel packages
We developed a strategy to design a travel package with the most popular and appropriate elements for the traveler; at the same time, this strategy minimizes the operation and processing costs of the travel agency. Association rules as a data mining technique is implemented to develop this model. We rely on the available massive travel agency database to make essential decisions related to the optimality of designing the travel package. A heuristic algorithm is an approach used to solve the final model. An illustrative numerical example based on a made-up data set is also provided
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信