Zhang Fu-Guo, Zeng An
School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, P.R. China; Jiangxi Key Laboratory of Data and Knowledge Engineering, Jiangxi University of Finance and Economics, Nanchang, 330013, P. R. China.
School of Systems Science, Beijing Normal University, Beijing, 100875, P. R. China.
PLoS One. 2015 Jun 30;10(6):e0129459. doi: 10.1371/journal.pone.0129459. eCollection 2015.
The rapid expansion of Internet brings us overwhelming online information, which is impossible for an individual to go through all of it. Therefore, recommender systems were created to help people dig through this abundance of information. In networks composed by users and objects, recommender algorithms based on diffusion have been proven to be one of the best performing methods. Previous works considered the diffusion process from user to object, and from object to user to be equivalent. We show in this work that it is not the case and we improve the quality of the recommendation by taking into account the asymmetrical nature of this process. We apply this idea to modify the state-of-the-art recommendation methods. The simulation results show that the new methods can outperform these existing methods in both recommendation accuracy and diversity. Finally, this modification is checked to be able to improve the recommendation in a realistic case.
互联网的迅速扩张给我们带来了海量的在线信息,个人不可能浏览所有这些信息。因此,推荐系统应运而生,以帮助人们筛选这些海量信息。在由用户和对象组成的网络中,基于扩散的推荐算法已被证明是性能最佳的方法之一。先前的研究认为从用户到对象以及从对象到用户的扩散过程是等效的。我们在这项研究中表明情况并非如此,并且通过考虑这一过程的不对称性来提高推荐质量。我们将这一想法应用于改进当前最先进的推荐方法。仿真结果表明,新方法在推荐准确性和多样性方面均优于现有方法。最后,经检验这种改进能够在实际案例中提升推荐效果。