A new algorithm based on bipartite graph networks for improving aggregate recommendation diversity

2nd Annual International Conference on Information System and Artificial Intelligence

物理学;计算机科学

Ma, Lulu^1 ; Zhang, Jun^2

Department of Finance, Shandong Normal University, Jinan, Shandong

250014, China^1

School of Information Science and Engineering, Shandong Normal University, Jinan, Shandong

250014, China^2

关键词: Augmenting path;    Bipartite graphs;    Long tail;    Movie ratings;    Real-world;    Recommendation algorithms;    Recommendation diversities;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/887/1/012056/pdf
DOI  :  10.1088/1742-6596/887/1/012056

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

Most of the traditional recommendation algorithms focus on the accuracy of recommendation results; however, the diversity of recommendation results is also important, which can be used to avoid the long-tail phenomenon. In this paper, a new algorithm for improving aggregate recommendation diversity is proposed. Firstly, a candidate recommendation list based on predictive scores is constructed; and then a bipartite graph network model is constructed. Secondly, item capacity is set to limit the number of recommendations of popular items. Finally, the final recommendation result is generated by combining the recommendation augmenting path. Based on the real world movie rating datasets, experiment results show that the proposed algorithm can effectively guarantee the accuracy of the recommendation results as well as improved the aggregate diversity of the recommendation.