Sub-graph Based Diffusion Model for Link Prediction
Denoising Diffusion Probabilistic Models (DDPMs) represent a contemporary class of generative models with exceptional qualities in both synthesis and maximizing the data likelihood. These models work by traversing a forward Markov Chain where data is perturbed, followed by a reverse process where a neural network learns to undo the perturbations and recover the original data. There have been increasing efforts exploring the applications of DDPMs in the graph domain. However, most of them have focused on the generative perspective. In this paper, we aim to build a novel generative model for link prediction. In particular, we treat link prediction between a pair of nodes as a conditional likelihood estimation of its enclosing sub-graph. With a dedicated design to decompose the likelihood estimation process via the Bayesian formula, we are able to separate the estimation of sub-graph structure and its node features. Such designs allow our model to simultaneously enjoy the advantages of inductive learning and the strong generalization capability. Remarkably, comprehensive experiments across various datasets validate that our proposed method presents numerous advantages: (1) transferability across datasets without retraining, (2) promising generalization on limited training data, and (3) robustness against graph adversarial attacks.
Code (0)
등록된 구현이 없습니다.
Tasks
DenoisingInductive LearningLink PredictionPredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Diffusion-based Negative Sampling on Graphs for Link Prediction
Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contra…
Link PredictionPredictionRecommendation SystemsSequence Diffusion Model for Temporal Link Prediction in Continuous-Time Dynamic Graph
Temporal link prediction in dynamic graphs is a fundamental problem in many real-world systems. Existing temporal graph neural networks mainly focus on learning representations of historical interactions. Despite their s…
Link PredictionGraph LearningSigned Graph Diffusion Network
Given a signed social graph, how can we learn appropriate node representations to infer the signs of missing edges? Signed social graphs have received considerable attention to model trust relationships. Learning node re…
Graph Neural NetworkLink Sign PredictionNetwork EmbeddingPrediction+1GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction
In this paper, we propose a Graph Inception Diffusion Networks(GIDN) model. This model generalizes graph diffusion in different feature spaces, and uses the inception module to avoid the large amount of computations caus…
Link PredictionSimplifying Subgraph Representation Learning for Scalable Link Prediction
Link prediction on graphs is a fundamental problem. Subgraph representation learning approaches (SGRLs), by transforming link prediction to graph classification on the subgraphs around the links, have achieved state-of-t…
Graph ClassificationGraph LearningGraph Representation LearningLink Prediction+2