基于不相似函数改进k均值聚类算法的商业用户消费行为特征分析

Jin Shen, Lin Mei, Yating Sun
{"title":"基于不相似函数改进k均值聚类算法的商业用户消费行为特征分析","authors":"Jin Shen, Lin Mei, Yating Sun","doi":"10.1109/ACAIT56212.2022.10137956","DOIUrl":null,"url":null,"abstract":"Aiming at the low efficiency and accuracy of K-means algorithm in processing massive data, an improved K-means clustering algorithm based on dissimilarity function was proposed. The Euclidean distance internal weighted method was used to improve the traditional distance algorithm, and a new dissimilarity function was constructed to calculate the distance of the cluster center. Experimental results showed that compared with the traditional K-means clustering algorithm, the improved K-means clustering algorithm has a faster convergence speed and higher accuracy in the algorithm verification. In practical applications, after cluster analysis is performed on the proportion of page access times, more accurate user consumption behavior characteristics are obtained. Therefore, based on the improved K-means clustering algorithm, the consumption behavior characteristics of business users can be described and analyzed well.","PeriodicalId":398228,"journal":{"name":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Consumption Behavior Characteristics of Business Users Based on Dissimilarity Function Improved K-Means Clustering Algorithm\",\"authors\":\"Jin Shen, Lin Mei, Yating Sun\",\"doi\":\"10.1109/ACAIT56212.2022.10137956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the low efficiency and accuracy of K-means algorithm in processing massive data, an improved K-means clustering algorithm based on dissimilarity function was proposed. The Euclidean distance internal weighted method was used to improve the traditional distance algorithm, and a new dissimilarity function was constructed to calculate the distance of the cluster center. Experimental results showed that compared with the traditional K-means clustering algorithm, the improved K-means clustering algorithm has a faster convergence speed and higher accuracy in the algorithm verification. In practical applications, after cluster analysis is performed on the proportion of page access times, more accurate user consumption behavior characteristics are obtained. Therefore, based on the improved K-means clustering algorithm, the consumption behavior characteristics of business users can be described and analyzed well.\",\"PeriodicalId\":398228,\"journal\":{\"name\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACAIT56212.2022.10137956\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACAIT56212.2022.10137956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对K-means算法在处理海量数据时效率低、准确率低的问题,提出了一种改进的基于不相似函数的K-means聚类算法。采用欧几里得距离内加权法对传统的距离算法进行改进,构造新的不相似度函数来计算聚类中心的距离。实验结果表明,与传统的K-means聚类算法相比,改进的K-means聚类算法在算法验证中具有更快的收敛速度和更高的精度。在实际应用中,通过对页面访问次数的比例进行聚类分析,可以得到更准确的用户消费行为特征。因此,基于改进的K-means聚类算法,可以很好地描述和分析商业用户的消费行为特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analysis of Consumption Behavior Characteristics of Business Users Based on Dissimilarity Function Improved K-Means Clustering Algorithm
Aiming at the low efficiency and accuracy of K-means algorithm in processing massive data, an improved K-means clustering algorithm based on dissimilarity function was proposed. The Euclidean distance internal weighted method was used to improve the traditional distance algorithm, and a new dissimilarity function was constructed to calculate the distance of the cluster center. Experimental results showed that compared with the traditional K-means clustering algorithm, the improved K-means clustering algorithm has a faster convergence speed and higher accuracy in the algorithm verification. In practical applications, after cluster analysis is performed on the proportion of page access times, more accurate user consumption behavior characteristics are obtained. Therefore, based on the improved K-means clustering algorithm, the consumption behavior characteristics of business users can be described and analyzed well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transformer with Global and Local Interaction for Pedestrian Trajectory Prediction The Use of Explainable Artificial Intelligence in Music—Take Professor Nick Bryan-Kinns’ “XAI+Music” Research as a Perspective Playing Fight the Landlord with Tree Search and Hidden Information Evaluation Evaluation Method of Innovative Economic Benefits of Enterprise Human Capital Based on Deep Learning An Attribute Contribution-Based K-Nearest Neighbor Classifier
×
引用
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