Search Results for author:
Found 5 papers, 5 papers with code
Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy
To this end, semi-supervised domain adaptation (SSDA) on graphs aims to leverage the knowledge of a labeled source graph to aid in node classification on a target graph with limited labels.
Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization
Category information plays a crucial role in enhancing the quality and personalization of recommender systems.
Domain Adaptive Graph Infomax via Conditional Adversarial Networks
The emerging graph neural networks (GNNs) have demonstrated impressive performance on the node classification problem in complex networks.
Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs
The high cost of data labeling often results in node label shortage in real applications.
Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolution
Existing methods for single network learning cannot solve this problem due to the domain shift across networks.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
