Hongtao Liu, Lulu Guo, Long Chen, Xueyan Liu, Zhenjia Zhu
{"title":"Effective Similarity Measures of Collaborative Filtering Recommendations Based on User Ratings Habits","authors":"Hongtao Liu, Lulu Guo, Long Chen, Xueyan Liu, Zhenjia Zhu","doi":"10.1109/SKG.2018.00026","DOIUrl":null,"url":null,"abstract":"The core of the recommendation system is the recommendation algorithm, especially the application of collaborative filtering recommendation algorithm is the most widely used. With the rapid increase of data sparsity. This paper aims at the problem of data sparsity in collaborative filtering algorithms. By mining the hidden information behind the user and the project, that is, considering different factors in the user's personal rating habits, and using Cosine and Jaccard to calculate the full degree of similarity to effectively use the rate data, improves the similarity calculation method, and solves the problem of low accuracy of the recommendation due to inaccuracy of similarity calculation. This is more in line with the logic of real life and can produce reasonable recommendations.","PeriodicalId":265760,"journal":{"name":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKG.2018.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The core of the recommendation system is the recommendation algorithm, especially the application of collaborative filtering recommendation algorithm is the most widely used. With the rapid increase of data sparsity. This paper aims at the problem of data sparsity in collaborative filtering algorithms. By mining the hidden information behind the user and the project, that is, considering different factors in the user's personal rating habits, and using Cosine and Jaccard to calculate the full degree of similarity to effectively use the rate data, improves the similarity calculation method, and solves the problem of low accuracy of the recommendation due to inaccuracy of similarity calculation. This is more in line with the logic of real life and can produce reasonable recommendations.