arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.02183cs.IR
收藏

一种等价图重构模型及其在推荐预测中的应用

An Equivalent Graph Reconstruction Model and its Application in Recommendation Prediction

Guangrui Yang, Lihua Yang, Qing Zhang, Zhihua Yang

AI总结:

本文针对基于图拉普拉斯正则化的推荐算法在大规模数据下计算代价高的问题,提出一种可精确求解的等价图重构模型,在保持预测精度的同时大幅降低计算开销。

摘要:

推荐算法在推荐系统(RS)中发挥着重要作用,它根据用户的已知信息预测用户对某些给定项目的兴趣和偏好。最近,一种基于图拉普拉斯正则化的推荐算法被提出,该算法将推荐系统的预测问题视为同一图模型下图信号的小样本重构问题。这种技术同时考虑了已知和未知标签样本的信息,从而获得了良好的预测精度。然而,当数据规模较大时,即使采用近似策略,求解该重构模型的计算代价仍然很高。本文提出了一种等价重构模型,该模型能够以极低的计算代价被精确求解。最后,提出了一种最终的预测算法。实验结果表明,所提方法在保持良好预测精度的同时,显著降低了计算代价。

英文摘要:

Recommendation algorithm plays an important role in recommendation system (RS), which predicts users' interests and preferences for some given items based on their known information. Recently, a recommendation algorithm based on the graph Laplacian regularization was proposed, which treats the prediction problem of the recommendation system as a reconstruction issue of small samples of the graph signal under the same graph model. Such a technique takes into account both known and unknown labeled samples information, thereby obtaining good prediction accuracy. However, when the data size is large, solving the reconstruction model is computationally expensive even with an approximate strategy. In this paper, we propose an equivalent reconstruction model that can be solved exactly with extremely low computational cost. Finally, a final prediction algorithm is proposed. We find in the experiments that the proposed method significantly reduces the computational cost while maintaining a good prediction accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑