Improving recommendations by adding user relationships to shallow autoencoders

Alternatives to Shallow Autoencoders for Collaborative Filtering

Machine LearningInformation Retrieval

Summary

Recommender systems suggest items like movies or products based on what users have liked before. A popular method, called EASE, uses item relationships but might miss subtle similarities between users. The authors propose new versions that also consider how users relate to each other, which helps make better recommendations. Their tests show these new approaches perform better than the original EASE method on common datasets.

What this means in practice

Authors

Mario Mallea, Angela Nebot, Francisco Mugica

Abstract

Collaborative filtering (CF) is a cornerstone of recommender systems and plays a relevant role in many modern applications. CF uses user-item interaction data to discover future preferences. Although deep learning models have shown promise in CF, Embarrassingly Shallow Autoencoders for Sparse Data (EASE) has gained attention for its outstanding ranking accuracy provided by its closed-form solution. EASE relies primarily on relationships among items to fit a full-rank high-dimensional linear mapping. We hypothesize that this design limits its capacity to capture similar but not equivalent fine-grained user relationships, consequently limiting its recommendation accuracy. This paper introduces an alternative formulation based on EASE that takes advantage of user-user information. Furthermore, we propose a hybrid model that combines both user-user and item-item adjacency distributions. Our experiments reveal that the proposed models outperform EASE on well-known recommendation benchmarks, highlighting the significance of including the user alternative in shallow autoencoder studies for CF.