{"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.