Application of improved k-means k-nearest neighbor algorithm in the movie recommendation system

Chang-Ping Cai, Li Wang
{"title":"Application of improved k-means k-nearest neighbor algorithm in the movie recommendation system","authors":"Chang-Ping Cai, Li Wang","doi":"10.1109/ISCID51228.2020.00076","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a clustering and reclassification method for movie recommendation. We use the improved K-means algorithm to cluster according to the scores of similar users, Firstly, the elbow function is used to estimate the number of clusters, and the elbow method is used to determine the K value. Then, the K-means algorithm of the maximum and minimum distance method is used to select the initial cluster center, and finally the cluster and cluster center are obtained. According to the similarity between the test data of the user's rating and user's personal information and the clustering center, they are divided into the cluster to which they belong, and the sample set in the cluster is used as the training set for K-nearest neighbor classification.","PeriodicalId":236797,"journal":{"name":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID51228.2020.00076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we propose a clustering and reclassification method for movie recommendation. We use the improved K-means algorithm to cluster according to the scores of similar users, Firstly, the elbow function is used to estimate the number of clusters, and the elbow method is used to determine the K value. Then, the K-means algorithm of the maximum and minimum distance method is used to select the initial cluster center, and finally the cluster and cluster center are obtained. According to the similarity between the test data of the user's rating and user's personal information and the clustering center, they are divided into the cluster to which they belong, and the sample set in the cluster is used as the training set for K-nearest neighbor classification.
改进的k-means k-近邻算法在电影推荐系统中的应用
本文提出了一种用于电影推荐的聚类和重分类方法。我们使用改进的K-means算法根据相似用户的得分进行聚类,首先使用肘部函数估计聚类数量,然后使用肘部法确定K值。然后,利用最大最小距离法的K-means算法选择初始聚类中心,最终得到聚类和聚类中心。根据用户评分和用户个人信息的测试数据与聚类中心的相似度,将其划分到所属的聚类中,并将聚类中的样本集作为k近邻分类的训练集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信