【作者】 罗辛； 欧阳元新； 熊璋； 袁满；

【Author】 LUO Xin OUYANG Yuan-Xin XIONG Zhang YUAN Man (School of Computer Science,Beihang University,Beijing 100191)

【机构】 北京航空航天大学计算机学院；

【摘要】 个性化推荐系统能基于用户个人兴趣为用户提供定制信息.此类系统通常使用协同过滤技术实现,其中一种广泛使用的经典模型是基于用户评分相似度的k近邻模型.使用k近邻模型需要预先计算出用户或者项目的k个最近邻居,k值过大时会导致计算量过大而影响推荐产生的实时性,而k值过小则会导致推荐精度下降.为解决此问题,该文中提出了一种新的最近邻度量——相似度支持度.基于相似度支持度,该文提出了数种能够在保持推荐精度和密度的前提下维持合理规模的k近邻的策略.在真实大规模数据集上的实验结果表明,相比传统算法,该文提出的策略能够在保证推荐精度的前提下大幅降低计算复杂度.更多还原

【Abstract】 Recommender systems which can provide people with personalized suggestions usually rely on Collaborative Filtering(CF).A classical approach to CF is based on k-nearest-neighborhood (kNN) model,where the most important task is constructing the kNN sets for involved users or items.However,when constructing kNN sets,there is a dilemma to decide the value of k—A too small value will lead to poor recommendation performance,whereas a too large one will result in unacceptable computational complexity.In this work the authors first empirically validated that the suitable value of k in kNN based CF was affected by the number of the totally involved entities,and then focused on improving the quality of the kNN sets in kNN based CF for providing high recommendation performance as well as maintaining suitable kNN set size.To achieve this objective,the authors propose a novel kNN metric named Similarity Support(SS). By taking SS into consideration during the kNN building process,the authors design a series of strategies for optimizing kNN based CF.The empirical studies on public large,real datasets show that due to the improvement on the quality of kNN set brought by SS,CF adjusted by the new strategies turned out to be superior to kNN based CF in term of both recommendation performance and computational complexity.更多还原