基于局部流行度的协同过滤器
Local Popularity Based Collaborative Filters
摘要:
受推荐系统等应用的启发,我们考虑由块常数随机矩阵的行和列置换获得的二进制随机场X的估计。对X的估计是基于观测值Y,观测值Y是通过将X的条目传递通过二进制对称信道(BSC)和擦除信道而获得的。我们专注于分析的一个特定的算法的基础上,当地的普及时,擦除率接近统一在一个指定的速率。我们研究了当矩阵大小接近无穷大时,在极限下的比特出错率。我们的主要结果表明,如果集群的大小(即,在原始矩阵中的恒定块的大小)是高于一定的阈值,那么BER接近零,但低于阈值,BER是下界远离零。下限取决于观测中的噪声水平和与阈值相关的聚类大小。阈值取决于擦除概率接近1的速率。
英文摘要:
Motivated by applications such as recommendation systems, we consider the estimation of a binary random field X obtained by row and column permutations of a block constant random matrix. The estimation of X is based on observations Y, which are obtained by passing entries of X through a binary symmetric channel (BSC) and an erasure channel. We focus on the analysis of a specific algorithm based on local popularity when the erasure rate approaches unity at a specified rate. We study the bit error rate (BER) in the limit as the matrix size approaches infinity. Our main result states that if the cluster size (that is, the size of the constancy blocks in the original matrix) is above a certain threshold, then the BER approaches zero, but below the threshold, the BER is lower bounded away from zero. The lower bound depends on the noise level in the observations and the size of the clusters in relation to the threshold. The threshold depends on the rate at which the erasure probability approaches unity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。