Collaborative Adversarial Learning for RelationalLearning on Multiple Bipartite Graphs

2020-07-16 · Jingchao Su, Xu Chen, Ya zhang, Siheng Chen, Dan Lv, Chenyang Li

Relational learning aims to make relation inference by exploiting the correlations among different types of entities. Exploring relational learning on multiple bipartite graphs has been receiving attention because of its popular applications such as recommendations. How to make efficient relation inference with few observed links is the main problem on multiple bipartite graphs. Most existing approaches attempt to solve the sparsity problem via learning shared representations to integrate knowledge from multi-source data for shared entities. However, they merely model the correlations from one aspect (e.g. distribution, representation), and cannot impose sufficient constraints on different relations of the shared entities. One effective way of modeling the multi-domain data is to learn the joint distribution of the shared entities across domains.In this paper, we propose Collaborative Adversarial Learning (CAL) that explicitly models the joint distribution of the shared entities across multiple bipartite graphs. The objective of CAL is formulated from a variational lower bound that maximizes the joint log-likelihoods of the observations. In particular, CAL consists of distribution-level and feature-level alignments for knowledge from multiple bipartite graphs. The two-level alignment acts as two different constraints on different relations of the shared entities and facilitates better knowledge transfer for relational learning on multiple bipartite graphs. Extensive experiments on two real-world datasets have shown that the proposed model outperforms the existing methods.

📄 PDF Abstract BibTeX arXiv:2007.08308

Code (0)

등록된 구현이 없습니다.

Tasks

Relational Reasoning Transfer Learning

Cascade-BGNN: Toward Efficient Self-supervised Representation Learning on Large-scale Bipartite Graphs

2019-06-27 · Chaoyang He, Tian Xie, Yu Rong, Wenbing Huang 외

Bipartite graphs have been used to represent data relationships in many data-mining applications such as in E-commerce recommendation systems. Since learning in graph space is more complicated than in Euclidian space, re…

Graph Neural Network Recommendation Systems Representation Learning

Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks

2021-02-12 · Hansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang 외

A bipartite network is a graph structure where nodes are from two distinct domains and only inter-domain interactions exist as edges. A large number of network embedding methods exist to learn vectorial node representati…

Link Prediction Network Embedding Node Classification

MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest

2022-05-21 · Saket Gurukar, Nikil Pancha, Andrew Zhai, Eric Kim 외

Graph Convolutional Networks (GCN) can efficiently integrate graph structure and node features to learn high-quality node embeddings. These embeddings can then be used for several tasks such as recommendation and search.…

Revisiting Neighborhood-based Link Prediction for Collaborative Filtering

2022-03-29 · Hao-Ming Fu, Patrick Poirson, Kwot Sin Lee, Chen Wang

Collaborative filtering (CF) is one of the most successful and fundamental techniques in recommendation systems. In recent years, Graph Neural Network (GNN)-based CF models, such as NGCF [31], LightGCN [10] and GTN [9] h…

Collaborative Filtering Graph Neural Network Link Prediction Prediction+1

Graph Convolutional Matrix Completion

2017-06-07 · Rianne van den Berg, Thomas N. Kipf, Max Welling

We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denot…

Collaborative Filtering Link Prediction Matrix Completion Recommendation Systems