Signed distance-based deep memory recommender

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

Abstract

Personalized recommendation algorithms learn a user's preference for an item by measuring a distance/similarity between them. However, some of the existing recommendation models (e.g., matrix factorization) assume a linear relationship between the user and item. This approach limits the capacity of recommender systems, since the interactions between users and items in real-world applications are much more complex than the linear relationship. To overcome this limitation, in this paper, we design and propose a deep learning framework called Signed Distance-based Deep Memory Recommender, which captures non-linear relationships between users and items explicitly and implicitly, and work well in both general recommendation task and shopping basket-based recommendation task. Through an extensive empirical study on six real-world datasets in the two recommendation tasks, our proposed approach achieved significant improvement over ten state-of-the-art recommendation models.

Cite

CITATION STYLE

APA

Tran, T., Lee, K., Liu, X., & Kong, X. (2019). Signed distance-based deep memory recommender. In The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019 (pp. 1841–1852). Association for Computing Machinery, Inc. https://doi.org/10.1145/3308558.3313460

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