协同过滤中一种高效的矩形最大容量评分启发算法
Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering
摘要:
协同过滤中的冷启动问题可以通过要求新用户对代表性项目的小种子集进行评分或通过要求代表性用户对新项目进行评分来解决。问题是如何建立一个种子集,可以提供足够的偏好信息,使好的建议。最成功的方法之一,称为基于代表的矩阵分解,是基于Maxvol算法。不幸的是,这种方法有一个重要的限制-一个特定大小的种子集需要一个固定秩的评级矩阵分解,该分解应该与该大小一致。这在一般情况下不一定是最佳的。在目前的文件中,我们介绍了一种快速算法,这种方法,我们称之为矩形Maxvol的分析推广。它允许因子分解的秩低于种子集所需的大小。此外,本文还对该方法的误差进行了理论分析,对现有方法的复杂性进行了分析,并与现有方法进行了比较。
英文摘要:
Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed set that can give enough preference information for making good recommendations. One of the most successful approaches, called Representative Based Matrix Factorization, is based on Maxvol algorithm. Unfortunately, this approach has one important limitation --- a seed set of a particular size requires a rating matrix factorization of fixed rank that should coincide with that size. This is not necessarily optimal in the general case. In the current paper, we introduce a fast algorithm for an analytical generalization of this approach that we call Rectangular Maxvol. It allows the rank of factorization to be lower than the required size of the seed set. Moreover, the paper includes the theoretical analysis of the method's error, the complexity analysis of the existing methods and the comparison to the state-of-the-art approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。