Generalized Embedding Machines for Recommender Systems
arXiv:2002.06561 · doi:10.1007/s11633-022-1412-6
Abstract
Factorization machine (FM) is an effective model for feature-based recommendation which utilizes inner product to capture second-order feature interactions. However, one of the major drawbacks of FM is that it couldn't capture complex high-order interaction signals. A common solution is to change the interaction function, such as stacking deep neural networks on the top of FM. In this work, we propose an alternative approach to model high-order interaction signals in the embedding level, namely Generalized Embedding Machine (GEM). The embedding used in GEM encodes not only the information from the feature itself but also the information from other correlated features. Under such situation, the embedding becomes high-order. Then we can incorporate GEM with FM and even its advanced variants to perform feature interactions. More specifically, in this paper we utilize graph convolution networks (GCN) to generate high-order embeddings. We integrate GEM with several FM-based models and conduct extensive experiments on two real-world datasets. The results demonstrate significant improvement of GEM over corresponding baselines.
8 pages
References in corpus (8)
- Semi-Supervised Classification with Graph Convolutional Networks
- BPR: Bayesian Personalized Ranking from Implicit Feedback
- DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems
- LightFR: Lightweight Federated Recommendation with Privacy-preserving Matrix Factorization
- Frappe: Understanding the Usage and Perception of Mobile App Recommendations In-The-Wild
- Higher-Order Factorization Machines
- Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms
- Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation