Revisiting SVD to generate powerful Node Embeddings for Recommendation Systems

Abstract

Graph Representation Learning (GRL) is an upcoming and promising area in recommendation systems. In this paper, we revisit the Singular Value Decomposition (SVD) of adjacency matrix for embedding generation of users and items and use a two-layer neural network on top of these embeddings to learn relevance between user-item pairs. Inspired by the success of higher-order learning in GRL, we further propose an extension of this method to include two-hop neighbors for SVD through the second order of the adjacency matrix and demonstrate improved performance compared with the simple SVD method which only uses one-hop neighbors. Empirical validation on three publicly available datasets of recommendation system demonstrates that the proposed methods, despite being simple, beat many state-of-the-art methods and for two of three datasets beats all of them up to a margin of 10%. Through our research, we want to shed light on the effectiveness of matrix factorization approaches, specifically SVD, in the deep learning era and show that these methods still contribute as important baselines in recommendation systems.

arXiv comment7 pages, 3 figures, and 4 tables

References in corpus (8)

• Adam: A Method for Stochastic Optimization
• Semi-Supervised Classification with Graph Convolutional Networks
• Inductive Representation Learning on Large Graphs
• T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction
• Graph Convolutional Matrix Completion
• Open Graph Benchmark: Datasets for Machine Learning on Graphs
• Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks
• BridgeDPI: A Novel Graph Neural Network for Predicting Drug-Protein Interactions