Low-Rank Matrix Completion over Finite Abelian Group Algebras for Context-Aware Recommendation

被引:4
作者
Yu, Chia-An [1 ]
Chan, Tak-Shing [1 ]
Yang, Yi-Hsuan [1 ]
机构
[1] Acad Sinica, Res Ctr IT Innovat, Taipei, Taiwan
来源
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT | 2017年
关键词
Context-aware recommendation; low-rank modeling; group algebra; matrix/tensor completion;
D O I
10.1145/3132847.3133057
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The incorporation of contextual information is an important part of context-aware recommendation. Many context-aware recommendation systems adopt tensor completion to include contextual information. However, the symmetries between dimensions of a tensor induce an unreasonable assumption that users, items and contexts should be treated equally in recommender systems. In this paper, we address this by using matrices over finite abelian group algebra (AGA) to model context-aware interactions between users and items. Specifically, we formulate context-aware recommendation as a low-rank matrix completion problem over AGA (MC-AGA) and derive a new algorithm using the inexact augmented Lagrange multiplier method. We then test MC-AGA on two real-world datasets: one containing implicit feedback and one with explicit feedback. Experiment results show that MC-AGA outperforms not only existing tensor completion algorithms but also recommendation systems with other context-aware representations.
引用
收藏
页码:2415 / 2418
页数:4
相关论文
共 19 条
[1]   Scalable tensor factorizations for incomplete data [J].
Acar, Evrim ;
Dunlavy, Daniel M. ;
Kolda, Tamara G. ;
Morup, Morten .
CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2011, 106 (01) :41-56
[2]  
[Anonymous], 2015, FRAPPE UNDERSTANDING
[3]  
[Anonymous], 2010, 100920105055 ARXIV
[4]  
[Anonymous], 2010, P 4 ACM C RECOMMEND
[5]  
[Anonymous], ARXIV170404362
[6]  
[Anonymous], RECOMMENDER SYSTEMS
[7]  
Bader B. W., 2015, MATLAB TENSOR TOOLBO
[8]   Polar n-Complex and n-Bicomplex Singular Value Decomposition and Principal Component Pursuit [J].
Chan, Tak-Shing T. ;
Yang, Yi-Hsuan .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (24) :6533-6544
[9]   Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions [J].
Halko, N. ;
Martinsson, P. G. ;
Tropp, J. A. .
SIAM REVIEW, 2011, 53 (02) :217-288
[10]  
Kamishima T., 2003, P KDD 03, P583, DOI DOI 10.1145/956750.956823