复杂网络中的混合推荐方法
Hybrid recommendation methods in complex networks
摘要:
我们在这里提出了两个新的推荐方法,基于适当的规范化已经存在的相似性措施,并在凸组合的推荐分数来自用户之间的相似性和对象之间。我们在三个相关的数据集上验证了所提出的措施,并将它们的性能与文献中最近提出的几个推荐系统进行了比较。我们表明,建议的相似性措施,允许实现高达20\%的性能改进,相对于现有的非参数方法,和建议的准确性可以有很大的不同,从一个特定的二分网络到另一个,这表明,仔细选择最合适的方法是高度相关的一个有效的建议在给定的系统。最后,我们研究了网络中随机链接的增加如何影响推荐分数,我们发现这里介绍的两种推荐算法之一可以在嘈杂的数据集中系统地优于其他算法。
英文摘要:
We propose here two new recommendation methods, based on the appropriate normalization of already existing similarity measures, and on the convex combination of the recommendation scores derived from similarity between users and between objects. We validate the proposed measures on three relevant data sets, and we compare their performance with several recommendation systems recently proposed in the literature. We show that the proposed similarity measures allow to attain an improvement of performances of up to 20\% with respect to existing non-parametric methods, and that the accuracy of a recommendation can vary widely from one specific bipartite network to another, which suggests that a careful choice of the most suitable method is highly relevant for an effective recommendation on a given system. Finally, we studied how an increasing presence of random links in the network affects the recommendation scores, and we found that one of the two recommendation algorithms introduced here can systematically outperform the others in noisy data sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。