论文标题
半监督学习达到分解:学习使用链图模型推荐
Semi-supervised Learning Meets Factorization: Learning to Recommend with Chain Graph Model
论文作者
论文摘要
最近,潜在因子模型(LFM)由于其良好的性能和可伸缩性,因此在推荐系统中引起了很多关注。但是,现有的LFM仅基于已知的级别的用户项目评级矩阵中的缺失值,因此额定矩阵的稀疏始终会限制其性能。同时,半监督学习(SSL)提供了一种有效的方法来通过执行标签传播来减轻标签(即评级)稀疏问题,这主要基于对亲和力图的平滑性见解。但是,基于图的SSL直接应用于建议时会遭受严重的可伸缩性和图形不可靠的问题。在本文中,我们提出了一种新型的概率链图模型(CGM),将SSL与LFM结合。提出的CGM是贝叶斯网络和马尔可夫随机场的组合。贝叶斯网络用于对评分生成和回归程序进行建模,Markov随机场用于模拟生成的评分之间的置信度平滑度约束。实验结果表明,我们提出的CGM在四个评估指标方面显着优于最先进的方法,并且当数据稀少度增加时,较大的性能率。
Recently latent factor model (LFM) has been drawing much attention in recommender systems due to its good performance and scalability. However, existing LFMs predict missing values in a user-item rating matrix only based on the known ones, and thus the sparsity of the rating matrix always limits their performance. Meanwhile, semi-supervised learning (SSL) provides an effective way to alleviate the label (i.e., rating) sparsity problem by performing label propagation, which is mainly based on the smoothness insight on affinity graphs. However, graph-based SSL suffers serious scalability and graph unreliable problems when directly being applied to do recommendation. In this paper, we propose a novel probabilistic chain graph model (CGM) to marry SSL with LFM. The proposed CGM is a combination of Bayesian network and Markov random field. The Bayesian network is used to model the rating generation and regression procedures, and the Markov random field is used to model the confidence-aware smoothness constraint between the generated ratings. Experimental results show that our proposed CGM significantly outperforms the state-of-the-art approaches in terms of four evaluation metrics, and with a larger performance margin when data sparsity increases.