Semi-supervised Learning Meets Factorization: Learning to Recommend with Chain Graph Model

被引:8
作者
Chen, Chaochao [1 ,2 ]
Chang, Kevin Chen-Chuan [2 ]
Li, Qibing [1 ]
Zheng, Xiaolin [1 ]
机构
[1] Zhejiang Univ, Hangzhou, Zhejiang, Peoples R China
[2] Univ Illinois, Champaign, IL USA
基金
中国国家自然科学基金;
关键词
Semi-supervised learning; latent factor model; chain graph model; data sparsity;
D O I
10.1145/3264745
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 article, 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.
引用
收藏
页数:24
相关论文
共 52 条
[1]  
Agarwal D., 2010, P 3 ACM INT C WEB SE, P91
[2]  
Agarwal D, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P19
[3]  
[Anonymous], 2012, P 29 INT C MACHINE L
[4]  
[Anonymous], 2010, P 4 ACM C REC SYST, DOI DOI 10.1145/1864708.1864736
[5]  
[Anonymous], 2011, P WSDM 11 P 4 ACM IN
[6]  
[Anonymous], 2015, ADV NEURAL INFORM PR
[7]  
[Anonymous], 2011, P 5 ACM C RECOMMENDE, DOI 10.1145/2043932.2044016
[8]  
[Anonymous], 2010, P 2010 SIAM INT C DA
[9]  
[Anonymous], 2013, P 7 ACM C RECOMMENDE
[10]  
[Anonymous], TECHNICAL REPORT