Adversarial Path Sampling for Recommender Systems

Generative adversarial networks (GANs) have achieved a big success in collaborative filtering (CF). However, existing GAN-based methods in CF still suffer from the high-sparsity and cold-start problems; in addition, they also undergo the issues of excessive space complexity or inadequate training. In this article, we propose path2rec a novel adversarial path-based recommendation model to address these limitations of existing GAN-based methods in recommendation task by naturally incorporating auxiliary information (e. g. , social networks and item attributes). It is composed of two modules, 1) pathGAN and 2) path2vec. In pathGAN, we consider both explicit and implicit friends, as well as item attributes by regarding them as the source of graph construction. Then, we propose a smart walk strategy to automatically generate an optimizing path, which can effectively learn the semantic distribution of users and items. In path2vec, to fully exploit context features of the generated path, we use the Continuous Bag of Words (CBOW) model to fine-tune nodes representations learned by pathGAN. Through extensive experiments on real-world datasets, we demonstrate the effectiveness of the proposed path2rec by applying it into top- n item recommendation, which reaches better performance than other counterparts.

Authors

• Rui Ding Microsoft
• Bowei Chen
• Guibing Guo Northeastern University
• Xiaochun Yang School of Computer Science and Engineering, Northeastern University, China

Keywords

• Training data
• Semantics
• Intelligent systems
• Complexity theory
• Generative adversarial networks
• Recommender systems
• Gallium nitride
• Sample Paths
• Representation Learning
• Real-world Datasets
• Space Complexity
• Effective Path
• Bag-of-words
• Inadequate Training
• Auxiliary Information
• History Of Interactions
• Spatial Complexity
• Collaborative Filtering
• Node Representations
• Popularity In Recent Years
• Restricted Boltzmann Machine
• Past Users
• Recommendation Model
• GAN-based Methods
• Cold-start Problem
• Real Path
• Node Embeddings
• Link Prediction
• Adversarial Training
• Nodes In The Graph
• Breadth-first Search
• Heterogeneous Network
• Depth-first
• Semantic Space
• Objective Function