Tourism Information Resource Sharing System Based on Customer Segmentation K-Means Algorithm

Meilian Li
{"title":"Tourism Information Resource Sharing System Based on Customer Segmentation K-Means Algorithm","authors":"Meilian Li","doi":"10.1145/3510858.3510905","DOIUrl":null,"url":null,"abstract":"With the rapid development of China's people's economic growth, people are more and more interested in tourism. With the development of Internet and network multimedia information technology, more and more users share all kinds of tourism information through the Internet. The tour information on the Internet is growing at an exponential rate. How to subdivide customers and recommend appropriate tourism information. This paper mainly analyzes the tourism information resource sharing system of customer segmentation k-means algorithm. Using k-means algorithm to cluster the longitude and latitude of customer tourism images, the images of a certain region can be segmented into images in small regions, Because the images of the same popular landmark are close in space, customer segmentation and sorting are carried out. The experimental results show that the tourism information resource sharing system based on customer segmentation k-means algorithm increases the tourism resource sharing rate by 18%, and analyzes the user's popular surface and representative address through the algorithm. Users will also be interested in the location and heat information of popular landmarks. To obtain the location information of popular landmarks, they only need to calculate the arithmetic mean of the longitude and latitude of the image corresponding to the image clustering of popular landmarks. The result is the longitude and latitude information corresponding to the popular landmark. The tourism information resource sharing system in this paper solves the problem of difficult choice for users. It can quickly obtain effective information from huge data resources and face complex tourism data. Accurate and complete tourism data information is the premise of realizing k-means algorithm + tourism, and obtaining high-quality tourism data resources is very important.","PeriodicalId":6757,"journal":{"name":"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)","volume":"45 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3510858.3510905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of China's people's economic growth, people are more and more interested in tourism. With the development of Internet and network multimedia information technology, more and more users share all kinds of tourism information through the Internet. The tour information on the Internet is growing at an exponential rate. How to subdivide customers and recommend appropriate tourism information. This paper mainly analyzes the tourism information resource sharing system of customer segmentation k-means algorithm. Using k-means algorithm to cluster the longitude and latitude of customer tourism images, the images of a certain region can be segmented into images in small regions, Because the images of the same popular landmark are close in space, customer segmentation and sorting are carried out. The experimental results show that the tourism information resource sharing system based on customer segmentation k-means algorithm increases the tourism resource sharing rate by 18%, and analyzes the user's popular surface and representative address through the algorithm. Users will also be interested in the location and heat information of popular landmarks. To obtain the location information of popular landmarks, they only need to calculate the arithmetic mean of the longitude and latitude of the image corresponding to the image clustering of popular landmarks. The result is the longitude and latitude information corresponding to the popular landmark. The tourism information resource sharing system in this paper solves the problem of difficult choice for users. It can quickly obtain effective information from huge data resources and face complex tourism data. Accurate and complete tourism data information is the premise of realizing k-means algorithm + tourism, and obtaining high-quality tourism data resources is very important.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于顾客细分K-Means算法的旅游信息资源共享系统
随着中国人民经济的快速发展,人们对旅游越来越感兴趣。随着互联网和网络多媒体信息技术的发展,越来越多的用户通过互联网分享各种旅游信息。互联网上的旅游信息正以指数级的速度增长。如何细分客户,推荐合适的旅游信息。本文主要分析了旅游信息资源共享系统中客户细分的k-means算法。利用k-means算法对客户旅游图像的经纬度进行聚类,可以将某一区域的图像分割成小区域的图像,由于同一热门地标的图像在空间上接近,因此进行客户分割和排序。实验结果表明,基于顾客细分k-means算法的旅游信息资源共享系统使旅游资源共享率提高了18%,并通过该算法分析了用户的流行面和代表地址。用户还会对热门地标的位置和热度信息感兴趣。为了获得热门地标的位置信息,他们只需要计算热门地标的图像聚类所对应的图像的经纬度的算术平均值。结果是与热门地标相对应的经纬度信息。本文提出的旅游信息资源共享系统解决了用户选择困难的问题。它可以从庞大的数据资源中快速获取有效信息,面对复杂的旅游数据。准确完整的旅游数据信息是实现k-means算法+旅游的前提,获得高质量的旅游数据资源非常重要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Visual Analysis Method of Food Safety Big Data Based on Artificial Intelligence Design of graduation practice management system in higher vocational colleges Data Analysis of Human Resource Performance Appraisal Based on Intelligent Attendance Web Platform Research and implementation of WinCE serial communication mechanism Application of Machine Learning Algorithms in Audit Data Analysis
×
引用
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