Het-node2vec: second order random walk sampling for heterogeneous
multigraphs embedding
- URL: http://arxiv.org/abs/2101.01425v2
- Date: Sun, 3 Sep 2023 14:21:18 GMT
- Title: Het-node2vec: second order random walk sampling for heterogeneous
multigraphs embedding
- Authors: Giorgio Valentini and Elena Casiraghi and Luca Cappelletti and Tommaso
Fontana and Justin Reese and Peter Robinson
- Abstract summary: We introduce an algorithmic framework that extends the node2vec node-neighborhood sampling method to heterogeneous multigraphs.
The resulting random walk samples capture both the structural characteristics of the graph and the semantics of the different types of nodes and edges.
- Score: 0.8668211481067458
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The development of Graph Representation Learning methods for heterogeneous
graphs is fundamental in several real-world applications, since in several
contexts graphs are characterized by different types of nodes and edges. We
introduce a an algorithmic framework (Het-node2vec) that extends the original
node2vec node-neighborhood sampling method to heterogeneous multigraphs. The
resulting random walk samples capture both the structural characteristics of
the graph and the semantics of the different types of nodes and edges. The
proposed algorithms can focus their attention on specific node or edge types,
allowing accurate representations also for underrepresented types of
nodes/edges that are of interest for the prediction problem under
investigation. These rich and well-focused representations can boost
unsupervised and supervised learning on heterogeneous graphs.
Related papers
- NodeFormer: A Scalable Graph Structure Learning Transformer for Node
Classification [70.51126383984555]
We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes.
The efficient computation is enabled by a kernerlized Gumbel-Softmax operator.
Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
arXiv Detail & Related papers (2023-06-14T09:21:15Z) - Discrete Graph Auto-Encoder [52.50288418639075]
We introduce a new framework named Discrete Graph Auto-Encoder (DGAE)
We first use a permutation-equivariant auto-encoder to convert graphs into sets of discrete latent node representations.
In the second step, we sort the sets of discrete latent representations and learn their distribution with a specifically designed auto-regressive model.
arXiv Detail & Related papers (2023-06-13T12:40:39Z) - Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph [57.2953563124339]
We propose a novel heterogeneous graph neural network with sequential node representation, namely Seq-HGNN.
We conduct extensive experiments on four widely used datasets from Heterogeneous Graph Benchmark (HGB) and Open Graph Benchmark (OGB)
arXiv Detail & Related papers (2023-05-18T07:27:18Z) - 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) - LoNe Sampler: Graph node embeddings by coordinated local neighborhood
sampling [0.7614628596146599]
Local graph neighborhood sampling is a fundamental computational problem that is at the heart of algorithms for node representation learning.
We present LoNe Sampler, a suite of algorithms for generating discrete node embeddings by Local Neighborhood Sampling.
arXiv Detail & Related papers (2022-11-28T08:04:26Z) - Graph Neural Networks with Feature and Structure Aware Random Walk [5.431036185361236]
We show that in typical heterphilous graphs, the edges may be directed, and whether to treat the edges as is or simply make them undirected greatly affects the performance of the GNN models.
We develop a model that adaptively learns the directionality of the graph, and exploits the underlying long-distance correlations between nodes.
arXiv Detail & Related papers (2021-11-19T08:54:21Z) - HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph
Learning [2.096172374930129]
We propose a new heterogeneous graph neural network model named HMSG.
We decompose the heterogeneous graph into multiple subgraphs.
Each subgraph associates specific semantic and structural information.
Through a type-specific attribute transformation, node attributes can also be transferred among different types of nodes.
arXiv Detail & Related papers (2021-09-07T05:02:59Z) - A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
We propose a robust framework for adversarial graph embedding, named AGE.
AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution.
Based on this framework, we propose three models to handle three types of graph data.
arXiv Detail & Related papers (2021-05-22T07:05:48Z) - Persistent Homology and Graphs Representation Learning [0.7734726150561088]
We study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology.
Our construction effectively defines a unique persistence-based graph descriptor, on both the graph and node levels.
To demonstrate the effectiveness of the proposed method, we study the topological descriptors induced by DeepWalk, Node2Vec and Diff2Vec.
arXiv Detail & Related papers (2021-02-25T15:26:21Z) - 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)
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.