{"title":"Item-based Collaborative Filtering Algorithm Based on Group Weighted Rating","authors":"Cong Li, Li Ma","doi":"10.1109/ISCID51228.2020.00032","DOIUrl":null,"url":null,"abstract":"Item-based collaborative filtering algorithm is one of the main collaborative filtering algorithms. However, its recommendation quality is seriously influenced by the sparsity of user ratings. To solve the problem, an improved item-based collaborative filtering algorithm based on group weighted rating is proposed. The union of user rating items is used as the basis of similarity computing between items, moreover a group weighted rating method has been proposed to compute and complete the missing values in the union of user rating items for decreasing the sparsity. The experimental results show that the new algorithm can efficiently improve recommendation quality.","PeriodicalId":236797,"journal":{"name":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","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.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Item-based collaborative filtering algorithm is one of the main collaborative filtering algorithms. However, its recommendation quality is seriously influenced by the sparsity of user ratings. To solve the problem, an improved item-based collaborative filtering algorithm based on group weighted rating is proposed. The union of user rating items is used as the basis of similarity computing between items, moreover a group weighted rating method has been proposed to compute and complete the missing values in the union of user rating items for decreasing the sparsity. The experimental results show that the new algorithm can efficiently improve recommendation quality.