Graph-based Recommendation for Sparse and Heterogeneous User Interactions

Abstract

Recommender system research has oftentimes focused on approaches that operate on large-scale datasets containing millions of user interactions. However, many small businesses struggle to apply state-of-the-art models due to their very limited availability of data. We propose a graph-based recommender model which utilizes heterogeneous interactions between users and content of different types and is able to operate well on small-scale datasets. A genetic algorithm is used to find optimal weights that represent the strength of the relationship between users and content. Experiments on two real-world datasets (which we make available to the research community) show promising results (up to 7% improvement), in comparison with other state-of-the-art methods for low-data environments. These improvements are statistically significant and consistent across different data samples.

References in corpus (11)

• KGAT: Knowledge Graph Attention Network for Recommendation
• Self-supervised Graph Learning for Recommendation
• Hypergraph Contrastive Collaborative Filtering
• A Review-aware Graph Contrastive Learning Framework for Recommendation
• Session-aware Recommendation: A Surprising Quest for the State-of-the-art
• Content-aware Neural Hashing for Cold-start Recommendation
• Sparse Feature Factorization for Recommender Systems with Knowledge Graphs
• Cold Start Similar Artists Ranking with Gravity-Inspired Graph Autoencoders
• MetaCVR: Conversion Rate Prediction via Meta Learning in Small-Scale Recommendation Scenarios
• Learning Recommendations from User Actions in the Item-poor Insurance Domain
• Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering