Modeling Edge Features with Deep Bayesian Graph Networks
- URL: http://arxiv.org/abs/2308.09087v1
- Date: Thu, 17 Aug 2023 16:29:17 GMT
- Title: Modeling Edge Features with Deep Bayesian Graph Networks
- Authors: Daniele Atzeni, Federico Errica, Davide Bacciu, Alessio Micheli
- Abstract summary: We introduce an additional Bayesian network mapping edge features into discrete states to be used by the original model.
By keeping the computational complexity linear in the number of edges, the proposed model is amenable to large-scale graph processing.
- Score: 23.32339964726699
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose an extension of the Contextual Graph Markov Model, a deep and
probabilistic machine learning model for graphs, to model the distribution of
edge features. Our approach is architectural, as we introduce an additional
Bayesian network mapping edge features into discrete states to be used by the
original model. In doing so, we are also able to build richer graph
representations even in the absence of edge features, which is confirmed by the
performance improvements on standard graph classification benchmarks. Moreover,
we successfully test our proposal in a graph regression scenario where edge
features are of fundamental importance, and we show that the learned edge
representation provides substantial performance improvements against the
original model on three link prediction tasks. By keeping the computational
complexity linear in the number of edges, the proposed model is amenable to
large-scale graph processing.
Related papers
- Scalable Weibull Graph Attention Autoencoder for Modeling Document Networks [50.42343781348247]
We develop a graph Poisson factor analysis (GPFA) which provides analytic conditional posteriors to improve the inference accuracy.
We also extend GPFA to a multi-stochastic-layer version named graph Poisson gamma belief network (GPGBN) to capture the hierarchical document relationships at multiple semantic levels.
Our models can extract high-quality hierarchical latent document representations and achieve promising performance on various graph analytic tasks.
arXiv Detail & Related papers (2024-10-13T02:22:14Z) - Hierarchical Blockmodelling for Knowledge Graphs [0.5530212768657544]
We use blockmodels for the purpose of hierarchical entity clustering on knowledge graphs.
The integration of the Nested Chinese Restaurant Process and the Stick Breaking Process into the generative model allows for the induction of hierarchical clusterings.
We evaluate our model on synthetic and real-world datasets and quantitatively compare against benchmark models.
arXiv Detail & Related papers (2024-08-28T09:04:15Z) - GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton.
The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases.
In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
arXiv Detail & Related papers (2022-12-01T11:49:07Z) - Latent Graph Inference using Product Manifolds [0.0]
We generalize the discrete Differentiable Graph Module (dDGM) for latent graph learning.
Our novel approach is tested on a wide range of datasets, and outperforms the original dDGM model.
arXiv Detail & Related papers (2022-11-26T22:13:06Z) - 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) - Bayesian Graph Contrastive Learning [55.36652660268726]
We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders.
Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector.
We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2021-12-15T01:45:32Z) - GraphMI: Extracting Private Graph Data from Graph Neural Networks [59.05178231559796]
We present textbfGraph textbfModel textbfInversion attack (GraphMI), which aims to extract private graph data of the training graph by inverting GNN.
Specifically, we propose a projected gradient module to tackle the discreteness of graph edges while preserving the sparsity and smoothness of graph features.
We design a graph auto-encoder module to efficiently exploit graph topology, node attributes, and target model parameters for edge inference.
arXiv Detail & Related papers (2021-06-05T07:07:52Z) - Edge-Featured Graph Attention Network [7.0629162428807115]
We present edge-featured graph attention networks (EGATs) to extend the use of graph neural networks to those tasks learning on graphs with both node and edge features.
By reforming the model structure and the learning process, the new models can accept node and edge features as inputs, incorporate the edge information into feature representations, and iterate both node and edge features in a parallel but mutual way.
arXiv Detail & Related papers (2021-01-19T15:08:12Z) - Optimal Transport Graph Neural Networks [31.191844909335963]
Current graph neural network (GNN) architectures naively average or sum node embeddings into an aggregated graph representation.
We introduce OT-GNN, a model that computes graph embeddings using parametric prototypes.
arXiv Detail & Related papers (2020-06-08T14:57:39Z) - Adaptive Graph Auto-Encoder for General Data Clustering [90.8576971748142]
Graph-based clustering plays an important role in the clustering area.
Recent studies about graph convolution neural networks have achieved impressive success on graph type data.
We propose a graph auto-encoder for general data clustering, which constructs the graph adaptively according to the generative perspective of graphs.
arXiv Detail & Related papers (2020-02-20T10:11:28Z)
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.