Affiliation:
1. Beijing Jiaotong University, Beijing Key Lab of Traffic Data Analysis and Mining, Beijing, China
2. Shanxi University, Institute of Big Data Science and Industry, Taiyuan, Shanxi, China
Abstract
Low-rank matrix approximation (LRMA) has attracted more and more attention in the community of recommendation. Even though LRMA-based recommendation methods (including Global LRMA and Local LRMA) obtain promising results, they suffer from the complicated structure of the large-scale and sparse rating matrix, especially when the underlying system includes a large set of items with various types and a huge amount of users with diverse interests. Thus, they have to predefine the important parameters, such as the rank of the rating matrix and the number of submatrices. Moreover, most existing Local LRMA methods are usually designed in a two-phase separated framework and do not consider the missing mechanisms of rating matrix. In this article, a non-parametric unified Bayesian graphical model is proposed for
A
daptive
Lo
cal low-rank
M
atrix
A
pproximation (
ALoMA
).
ALoMA
has ability to simultaneously identify rating submatrices, determine the optimal rank for each submatrix, and learn the submatrix-specific user/item latent factors. Meanwhile, the missing mechanism is adopted to characterize the whole rating matrix. These four parts are seamlessly integrated and enhance each other in a unified framework. Specifically, the user-item rating matrix is adaptively divided into proper number of submatrices in
ALoMA
by exploiting the Chinese Restaurant Process. For each submatrix, by considering both global/local structure information and missing mechanisms, the latent user/item factors are identified in an optimal latent space by adopting automatic relevance determination technique. We theoretically analyze the model’s generalization error bounds and give an approximation guarantee. Furthermore, an efficient Gibbs sampling-based algorithm is designed to infer the proposed model. A series of experiments have been conducted on six real-world datasets (
Epinions
,
Douban
,
Dianping
,
Yelp
,
Movielens (10M),
and
Netflix
). The results demonstrate that
ALoMA
outperforms the state-of-the-art LRMA-based methods and can easily provide interpretable recommendation results.
Funder
Beijing Natural Science Foundation
National Key Research and Development Program of China
Beijing Municipal Science and Technology Commission
Foundation for Innovative Research Groups of the National Natural Science Foundation of China
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Reference37 articles.
1. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
2. Chris Anderson. 2006. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion. Chris Anderson. 2006. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion.
3. ACCAMS
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Generalized Matrix Local Low Rank Representation by Random Projection and Submatrix Propagation;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04
2. Bayesian Additive Matrix Approximation for Social Recommendation;ACM Transactions on Knowledge Discovery from Data;2021-07-03