BLOMA: Explain Collaborative Filtering via Boosted Local Rank-One Matrix Approximation

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Matrix Approximation (MA) is a powerful technique in recommendation systems. There are two main problems in the prevalent MA framework. First, the latent factor is out of explanation and hampers the understanding of the reasons behind recommendations. Besides, traditional MA methods produce user/item factors globally, which fails to capture the idiosyncrasies of users/items. In this paper, we propose a model called Boosted Local rank-One Matrix Approximation (BLOMA). The core idea is to locally and sequentially approximate the residual matrix (which represents the unexplained part obtained from the previous stage) by rank-one sub-matrix factorization. The result factors are distinct and explainable by leveraging social networks and item attributes.

Cite

CITATION STYLE

APA

Gao, C., Yuan, S., Zhang, Z., Yin, H., & Shao, J. (2019). BLOMA: Explain Collaborative Filtering via Boosted Local Rank-One Matrix Approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11448 LNCS, pp. 487–490). Springer Verlag. https://doi.org/10.1007/978-3-030-18590-9_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free