Signed Distance-based Deep Memory Recommender

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.

References in corpus (7)

• BPR: Bayesian Personalized Ranking from Implicit Feedback
• A Structured Self-attentive Sentence Embedding
• Personalizing Session-based Recommendations with Hierarchical Recurrent Neural Networks
• Translation-based Recommendation
• Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)
• Neural Collaborative Filtering
• Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation