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.
Pre-training Graph Transformer with Multimodal Side Information for Recommendation
Alibaba-NTU Singapore Joint Research Institute(阿里巴巴-新加坡南洋理工大学联合研究院);Nanyang Technological University(南洋理工大学);University of Science and Technology of China(中国科学技术大学);Alibaba Group(阿里巴巴集团);Zhejiang University(浙江大学)
On the Equivalence Between Auto-Regressive Next Token Prediction and Full-Item-Vocabulary Maximum Likelihood Estimation in Generative Recommendation--A Short Note
From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation
College of Computer Science, Chongqing University(重庆大学计算机学院);MAIS, Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所MAIS部门);Independent Researcher(独立研究员);Aerospace Information Research Institute, Chinese Academy of Sciences(中国科学院航空航天信息研究所);Department of Computer Science, City University of Hong Kong(香港城市大学计算机科学系)
本文提出Masked History Learning框架,通过重建掩码的历史项目增强对用户行为的理解,从而提升推荐准确性。
Causal Structure Representation Learning of Confounders in Latent Space for Recommendation
MIC Lab, College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院MIC实验室);Key Laboratory of Trustworthy Distributed Computing and Service (MoE), Beijing University of Posts and Telecommunications(北京邮电大学可信分布式计算与服务重点实验室);Institute of Artificial Intelligence, Beihang University and Zhongguancun Laboratory(北航人工智能研究院和中关村实验室)