Generative Graph Neural Networks for Link Prediction
- URL: http://arxiv.org/abs/2301.00169v1
- Date: Sat, 31 Dec 2022 10:07:19 GMT
- Title: Generative Graph Neural Networks for Link Prediction
- Authors: Xingping Xian, Tao Wu, Xiaoke Ma, Shaojie Qiao, Yabin Shao, Chao Wang,
Lin Yuan, Yu Wu
- Abstract summary: Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis.
This paper proposes a novel and radically different link prediction algorithm based on the network reconstruction theory, called GraphLP.
Unlike the discriminative neural network models used for link prediction, GraphLP is generative, which provides a new paradigm for neural-network-based link prediction.
- Score: 13.643916060589463
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Inferring missing links or detecting spurious ones based on observed graphs,
known as link prediction, is a long-standing challenge in graph data analysis.
With the recent advances in deep learning, graph neural networks have been used
for link prediction and have achieved state-of-the-art performance.
Nevertheless, existing methods developed for this purpose are typically
discriminative, computing features of local subgraphs around two neighboring
nodes and predicting potential links between them from the perspective of
subgraph classification. In this formalism, the selection of enclosing
subgraphs and heuristic structural features for subgraph classification
significantly affects the performance of the methods. To overcome this
limitation, this paper proposes a novel and radically different link prediction
algorithm based on the network reconstruction theory, called GraphLP. Instead
of sampling positive and negative links and heuristically computing the
features of their enclosing subgraphs, GraphLP utilizes the feature learning
ability of deep-learning models to automatically extract the structural
patterns of graphs for link prediction under the assumption that real-world
graphs are not locally isolated. Moreover, GraphLP explores high-order
connectivity patterns to utilize the hierarchical organizational structures of
graphs for link prediction. Our experimental results on all common benchmark
datasets from different applications demonstrate that the proposed method
consistently outperforms other state-of-the-art methods. Unlike the
discriminative neural network models used for link prediction, GraphLP is
generative, which provides a new paradigm for neural-network-based link
prediction.
Related papers
- GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based
Histogram Intersection [51.608147732998994]
Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning.
We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
arXiv Detail & Related papers (2024-01-17T13:04:23Z) - State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
Graph-level learning has been applied to many tasks including comparison, regression, classification, and more.
Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures.
Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
arXiv Detail & Related papers (2023-01-14T09:15:49Z) - A Complex Network based Graph Embedding Method for Link Prediction [0.0]
We present a novel graph embedding approach based on the popularity-similarity and local attraction paradigms.
We show, using extensive experimental analysis, that the proposed method outperforms state-of-the-art graph embedding algorithms.
arXiv Detail & Related papers (2022-09-11T14:46:38Z) - Optimal Propagation for Graph Neural Networks [51.08426265813481]
We propose a bi-level optimization approach for learning the optimal graph structure.
We also explore a low-rank approximation model for further reducing the time complexity.
arXiv Detail & Related papers (2022-05-06T03:37:00Z) - Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph
Convolutional Neural Networks [0.6236890292833384]
In this paper, we propose a novel algorithm called Bayesian Graph Convolutional Network using Neighborhood Random Walk Sampling (BGCN-NRWS)
BGCN-NRWS uses a Markov Chain Monte Carlo (MCMC) based graph sampling algorithm utilizing graph structure, reduces overfitting by using a variational inference layer, and yields consistently competitive classification results compared to the state-of-the-art in semi-supervised node classification.
arXiv Detail & Related papers (2021-12-14T20:58:27Z) - How Neural Processes Improve Graph Link Prediction [35.652234989200956]
We propose a meta-learning approach with graph neural networks for link prediction: Neural Processes for Graph Neural Networks (NPGNN)
NPGNN can perform both transductive and inductive learning tasks and adapt to patterns in a large new graph after training with a small subgraph.
arXiv Detail & Related papers (2021-09-30T07:35:13Z) - Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching.
The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k)
It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
arXiv Detail & Related papers (2021-09-01T08:24:02Z) - Line Graph Neural Networks for Link Prediction [71.00689542259052]
We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications.
In this formalism, a link prediction problem is converted to a graph classification task.
We propose to seek a radically different and novel path by making use of the line graphs in graph theory.
In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
arXiv Detail & Related papers (2020-10-20T05:54:31Z) - A comparative study of similarity-based and GNN-based link prediction
approaches [1.0441880303257467]
The graph neural network (GNN) is able to learn hidden features from graphs which can be used for link prediction task in graphs.
This paper studies some similarity and GNN-based link prediction approaches in the domain of homogeneous graphs.
arXiv Detail & Related papers (2020-08-20T10:41:53Z) - Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph
Link Prediction [69.1473775184952]
We introduce a realistic problem of few-shot out-of-graph link prediction.
We tackle this problem with a novel transductive meta-learning framework.
We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
arXiv Detail & Related papers (2020-06-11T17:42:46Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.