%A Jiang Shuhao, Pan Xuhua, Xue Fuliang %T An Independent Recommendation Diversity Optimization Algorithm Based on Item Clustering %0 Journal Article %D 2015 %J Data Analysis and Knowledge Discovery %R 10.11925/infotech.1003-3513.2015.05.05 %P 34-41 %V 31 %N 5 %U {https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/abstract/article_4051.shtml} %8 2015-05-25 %X

[Objective] To optimize the diversity of the recommendation list by clustering weight redistribution. [Methods] This paper presents an algorithm to improve the recommendation diversity. Clustering is based on item scores. Clustering weight redistribution algorithm is used to reassign each clustering weight, and final recommendation list is generated from each cluster according to the weight. [Results] Experimental results show that z-diversity values of the recommendation list generated is increased by 0.46, 0.65 and 1.88 respectively for three algorithms on MovieLens data set, and z-diversity values is increased by 0.38, 0.49 and 0.76 respectively on Book-Crossing data set, when threshold is reduced from 20 to 1. [Limitations] This algorithm only applies to improve the recommendation list and does not involve the aggregate diversity. [Conclusions] This algorithm effectively improves diversity, while ensuring accuracy and lower time complexity compared with bounded greedy algorithm.