一种基于邻域流行度的协同过滤器分析
Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors
摘要:
在本文中,我们分析了一个协作过滤器,回答了一个简单的问题:什么是流行的朋友?虽然这一基本原则似乎在许多实际实现中普遍存在,但似乎没有对其性能进行太多的理论分析。在本文中,我们部分填补了这一空白。虽然最近的作品在这个主题上,如低秩矩阵完成文献,考虑在恢复整个评级矩阵的错误的概率,我们认为在一个单独的建议(位出错率(BER))的错误的概率。对于[1],[2]中介绍的数学模型,我们确定了我们的算法(名为朋友间的流行度(PAF))在矩阵大小增长到无穷大时的极限操作的三个制度。在以大量样本和小自由度为特征的区域中(本文中的模型精确定义),渐近BER为零;在以大量样本和大自由度为特征的区域中,渐近BER有界远离0和1/2(并且除了特殊情况之外被精确地识别);并且在以少量样本为特征的状态中,算法失败。我们还提供了MovieLens和Netflix数据集的数值结果。我们讨论了我们的理论结果的经验性能,并与基于低秩矩阵完成的方法进行比较。
英文摘要:
In this paper, we analyze a collaborative filter that answers the simple question: What is popular amongst your friends? While this basic principle seems to be prevalent in many practical implementations, there does not appear to be much theoretical analysis of its performance. In this paper, we partly fill this gap. While recent works on this topic, such as the low-rank matrix completion literature, consider the probability of error in recovering the entire rating matrix, we consider probability of an error in an individual recommendation (bit error rate (BER)). For a mathematical model introduced in [1],[2], we identify three regimes of operation for our algorithm (named Popularity Amongst Friends (PAF)) in the limit as the matrix size grows to infinity. In a regime characterized by large number of samples and small degrees of freedom (defined precisely for the model in the paper), the asymptotic BER is zero; in a regime characterized by large number of samples and large degrees of freedom, the asymptotic BER is bounded away from 0 and 1/2 (and is identified exactly except for a special case); and in a regime characterized by a small number of samples, the algorithm fails. We also present numerical results for the MovieLens and Netflix datasets. We discuss the empirical performance in light of our theoretical results and compare with an approach based on low-rank matrix completion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。