k -的算法是对旅游代理旅游路线的定义

Eni Irfiani, Fintri Indriyani
{"title":"k -的算法是对旅游代理旅游路线的定义","authors":"Eni Irfiani, Fintri Indriyani","doi":"10.33022/ijcs.v9i1.244","DOIUrl":null,"url":null,"abstract":"Government support for the development of tourism has an impact on the growth of business opportunities for travel agents. Along with the advancement of the domestic travel sector, tour & travel agent business forms have sprung up that influence business competition between travel agents. The problem with tour & travel agents is the lack of information about tourist routes that are most in-demand by customers. To solve this problem the method used to classify the most desirable travel routes using the method of data mining is clustering with the K-Means algorithm. Based on the results of the study found three groups of travel routes, namely the most desirable travel routes by 20%, the trips that are in demand by 30% and less desirable trips by 50%.","PeriodicalId":127788,"journal":{"name":"International Journal in Computer Simulation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algoritma K-Means Untuk Clustering Rute Perjalanan Wisata Pada Agen Tour & Travel\",\"authors\":\"Eni Irfiani, Fintri Indriyani\",\"doi\":\"10.33022/ijcs.v9i1.244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Government support for the development of tourism has an impact on the growth of business opportunities for travel agents. Along with the advancement of the domestic travel sector, tour & travel agent business forms have sprung up that influence business competition between travel agents. The problem with tour & travel agents is the lack of information about tourist routes that are most in-demand by customers. To solve this problem the method used to classify the most desirable travel routes using the method of data mining is clustering with the K-Means algorithm. Based on the results of the study found three groups of travel routes, namely the most desirable travel routes by 20%, the trips that are in demand by 30% and less desirable trips by 50%.\",\"PeriodicalId\":127788,\"journal\":{\"name\":\"International Journal in Computer Simulation\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal in Computer Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33022/ijcs.v9i1.244\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal in Computer Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33022/ijcs.v9i1.244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

政府对旅游业发展的支持对旅行社的商机增长产生了影响。随着国内旅游业的发展,旅行社业态不断涌现,影响着旅行社之间的业务竞争。旅行社的问题是缺乏关于顾客最需要的旅游路线的信息。为了解决这一问题,使用数据挖掘方法对最理想的旅行路线进行分类的方法是使用K-Means算法聚类。根据研究结果发现了三组旅行路线,即最理想的旅行路线占20%,需求的旅行路线占30%,不太理想的旅行路线占50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Algoritma K-Means Untuk Clustering Rute Perjalanan Wisata Pada Agen Tour & Travel
Government support for the development of tourism has an impact on the growth of business opportunities for travel agents. Along with the advancement of the domestic travel sector, tour & travel agent business forms have sprung up that influence business competition between travel agents. The problem with tour & travel agents is the lack of information about tourist routes that are most in-demand by customers. To solve this problem the method used to classify the most desirable travel routes using the method of data mining is clustering with the K-Means algorithm. Based on the results of the study found three groups of travel routes, namely the most desirable travel routes by 20%, the trips that are in demand by 30% and less desirable trips by 50%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Assistance in Making Form Design and Recording Medical Records for Toddlers at Posyandu Kutilang, Sukowiyono Village, Kec. Padas, Ngawi Regency The 6 Steps of Handwashing Education The Partnership Model for Women Farmers by Processing Mangosteen Skin Waste as a Functional Food Substitute Socialization Of Clean And Healthy Living Behaviors And Screening Of Non-Communicable Diseases In Efforts To Prevent The Pandemic Covid-19 Community Empowerment Based on Local Potentials Through the Creation of “Cassava Nugget” Products in Dukuh Binangun, Werdi Village, Paninggaran District
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1