When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes ...When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.展开更多
Collaborative filtering algorithms(CF)and mass diffusion(MD)algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload.However,both algorithms suffer f...Collaborative filtering algorithms(CF)and mass diffusion(MD)algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload.However,both algorithms suffer from data sparsity,and both tend to recommend popular products,which have poor diversity and are not suitable for real life.In this paper,we propose a user internal similarity-based recommendation algorithm(UISRC).UISRC first calculates the item-item similarity matrix and calculates the average similarity between items purchased by each user as the user’s internal similarity.The internal similarity of users is combined to modify the recommendation score to make score predictions and suggestions.Simulation experiments on RYM and Last.FM datasets,the results show that UISRC can obtain better recommendation accuracy and a variety of recommendations than traditional CF and MD algorithms.展开更多
基金supported by Phase 4,Software Engineering(Software Service Engineering)under Grant No.XXKZD1301
文摘When dealing with the ratings from users,traditional collaborative filtering algorithms do not consider the credibility of rating data,which affects the accuracy of similarity.To address this issue,the paper proposes an improved algorithm based on classification and user trust.It firstly classifies all the ratings by the categories of items.And then,for each category,it evaluates the trustworthy degree of each user on the category and imposes the degree on the ratings of the user.Finally,the algorithm explores the similarities between users,finds the nearest neighbors,and makes recommendations within each category.Simulations show that the improved algorithm outperforms the traditional collaborative filtering algorithms and enhances the accuracy of recommendation.
基金supported by the National Natural Science Foundation of China(Grant No.61703212).
文摘Collaborative filtering algorithms(CF)and mass diffusion(MD)algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload.However,both algorithms suffer from data sparsity,and both tend to recommend popular products,which have poor diversity and are not suitable for real life.In this paper,we propose a user internal similarity-based recommendation algorithm(UISRC).UISRC first calculates the item-item similarity matrix and calculates the average similarity between items purchased by each user as the user’s internal similarity.The internal similarity of users is combined to modify the recommendation score to make score predictions and suggestions.Simulation experiments on RYM and Last.FM datasets,the results show that UISRC can obtain better recommendation accuracy and a variety of recommendations than traditional CF and MD algorithms.
