MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendation
Not on the map. Why?
Abstract (arXiv)
Graph neural networks have been widely used in recent recommender systems, where negative sampling plays an important role. Existing negative sampling methods restrict the relationship between nodes as either hard positive pairs or hard negative pairs. This leads to the loss of structural information, and lacks the mechanism to generate positive pairs for nodes with few neighbors. To overcome limitations, we propose a novel soft link-based sampling method, namely MixDec Sampling, which consists of Mixup Sampling module and Decay Sampling module. The Mixup Sampling augments node features by synthesizing new nodes and soft links, which provides sufficient number of samples for nodes with few neighbors. The Decay Sampling strengthens the digestion of graph structure information by generating soft links for node embedding learning. To the best of our knowledge, we are the first to model sampling relationships between nodes by soft links in GNN-based recommender systems. Extensive experiments demonstrate that the proposed MixDec Sampling can significantly and consistently improve the recommendation performance of several representative GNN-based models on various recommendation benchmarks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 42 references that are in the map. First posted on arXiv 12 Feb 2025.
Builds on
23 of 42 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
11 more
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
- 2019Augmenting Data with Mixup for Sentence Classification: An Empirical Studycited by 125
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
- 2021GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Predictioncited by 36
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2022Global Mixup: Eliminating Ambiguity with Clusteringcited by 3
Built on by
Not cited yet.