Learning Sparse Graphs with a Core-periphery Structure
- URL: http://arxiv.org/abs/2110.04022v1
- Date: Fri, 8 Oct 2021 10:41:30 GMT
- Title: Learning Sparse Graphs with a Core-periphery Structure
- Authors: Sravanthi Gurugubelli and Sundeep Prabhakar Chepuri
- Abstract summary: We propose a generative model for data associated with core-periphery structured networks.
We infer a sparse graph and nodal core scores that induce dense (sparse) connections in core parts of the network.
- Score: 14.112444998191698
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we focus on learning sparse graphs with a core-periphery
structure. We propose a generative model for data associated with
core-periphery structured networks to model the dependence of node attributes
on core scores of the nodes of a graph through a latent graph structure. Using
the proposed model, we jointly infer a sparse graph and nodal core scores that
induce dense (sparse) connections in core (respectively, peripheral) parts of
the network. Numerical experiments on a variety of real-world data indicate
that the proposed method learns a core-periphery structured graph from node
attributes alone, while simultaneously learning core score assignments that
agree well with existing works that estimate core scores using graph as input
and ignoring commonly available node attributes.
Related papers
- Contrastive Representation Learning Based on Multiple Node-centered
Subgraphs [11.416941835869649]
A single node intuitively has multiple node-centered subgraphs from the whole graph.
We propose a multiple node-centered subgraphs contrastive representation learning method to learn node representation on graphs in a self-supervised way.
arXiv Detail & Related papers (2023-08-31T04:04:09Z) - 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) - Generative Models and Learning Algorithms for Core-Periphery Structured
Graphs [13.90938823562779]
We focus on learning the core scores of a graph from its node attributes and connectivity structure.
We develop algorithms for inferring the model parameters and core scores of a graph when both the graph structure and node attributes are available.
arXiv Detail & Related papers (2022-10-04T09:44:09Z) - GraphSVX: Shapley Value Explanations for Graph Neural Networks [81.83769974301995]
Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data.
In this paper, we propose a unified framework satisfied by most existing GNN explainers.
We introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs.
arXiv Detail & Related papers (2021-04-18T10:40:37Z) - node2coords: Graph Representation Learning with Wasserstein Barycenters [59.07120857271367]
We introduce node2coords, a representation learning algorithm for graphs.
It learns simultaneously a low-dimensional space and coordinates for the nodes in that space.
Experimental results demonstrate that the representations learned with node2coords are interpretable.
arXiv Detail & Related papers (2020-07-31T13:14:25Z) - Representation Learning of Graphs Using Graph Convolutional Multilayer
Networks Based on Motifs [17.823543937167848]
mGCMN is a novel framework which utilizes node feature information and the higher order local structure of the graph.
It will greatly improve the learning efficiency of the graph neural network and promote a brand-new learning mode establishment.
arXiv Detail & Related papers (2020-07-31T04:18:20Z) - Graph Pooling with Node Proximity for Hierarchical Representation
Learning [80.62181998314547]
We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology.
Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
arXiv Detail & Related papers (2020-06-19T13:09:44Z) - Graph Neural Networks with Composite Kernels [60.81504431653264]
We re-interpret node aggregation from the perspective of kernel weighting.
We present a framework to consider feature similarity in an aggregation scheme.
We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
arXiv Detail & Related papers (2020-05-16T04:44:29Z) - Convolutional Kernel Networks for Graph-Structured Data [37.13712126432493]
We introduce a family of multilayer graph kernels and establish new links between graph convolutional neural networks and kernel methods.
Our approach generalizes convolutional kernel networks to graph-structured data, by representing graphs as a sequence of kernel feature maps.
Our model can also be trained end-to-end on large-scale data, leading to new types of graph convolutional neural networks.
arXiv Detail & Related papers (2020-03-11T09:44:03Z) - Graph Inference Learning for Semi-supervised Classification [50.55765399527556]
We propose a Graph Inference Learning framework to boost the performance of semi-supervised node classification.
For learning the inference process, we introduce meta-optimization on structure relations from training nodes to validation nodes.
Comprehensive evaluations on four benchmark datasets demonstrate the superiority of our proposed GIL when compared against state-of-the-art methods.
arXiv Detail & Related papers (2020-01-17T02:52:30Z)
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.