基于自适应样本权重的矩阵分解推荐算法

Matrix Factorization Recommendation Algorithm Based on Adaptive Weighted Samples

稀疏数据矩阵缺失值估计是一项必要的基础性研究,在推荐系统中尤为重要,针对该问题的一种有效方法便是矩阵分解算法(Matrix Factorization,MF),但传统MF算法仅直接使用回归思想拟合矩阵样本点,并没有考虑样本自身拟合难易程度的差异性。针对该情况,文中分析提出了一种基于自适应样本权重的矩阵分解算法(AWS-MF),在原有MF算法的基础上,针对样本差异性进行有偏向模型拟合,为增加模型回归的准确性与稳定性,加权整合中间算法结果,从而得到最终的拟合数据值。实验结果表明,相比于MF算法和NMF算法,改进后的AWS-MF算法能根据样本差异性自动调整样本权重占比,在充分利用已有数据的前提下,最终得到更好的缺失值估计结果。

Missing value estimation of sparse matrix is a necessary basic research,which is also particularly important and significant in some practical applications,such as the recommendation system.There are many methods to solve this problem,one of the most effective method to tackle this issue is Matrix Factorization(MF).However,the traditional MF algorithm has some limitations,which can only directly simulate the elements of the sparse matrix by using regression method.But it did not take into account the sample itself,which has different difficulty in regression and should be treated respectively.According to this limitation,this paper proposed a matrix factorization recommendation algorithm based on adaptive weighted samples(AWS-MF).Based on the traditional MF algorithm,the proposed method exploits the differences among the training samples and treats each sample in a bias weights.In order to improve the performance and robustness of our model,the intermediate results are combined together in the final process to obtain the objective predictions.To verify the superiority of the proposed method,the comprehensive experiments were conducted on the real-world data sets.The experiment results demonstrate that the proposed AWS-MF algorithm is able to adaptively re-weight samples according to the differences among them.Moreover,treating the samples respectively can lead to a promising performance in the real-world applications compared to the baseline methods.