A Multi-purposed Unsupervised Framework for Comparing Embeddings of
Undirected and Directed Graphs
- URL: http://arxiv.org/abs/2112.00075v1
- Date: Tue, 30 Nov 2021 20:20:30 GMT
- Title: A Multi-purposed Unsupervised Framework for Comparing Embeddings of
Undirected and Directed Graphs
- Authors: Bogumi{\l} Kami\'nski, {\L}ukasz Krai\'nski, Pawe{\l} Pra{\l}at,
Fran\c{c}ois Th\'eberge
- Abstract summary: We extend the framework for evaluating graph embeddings that was recently introduced by the authors.
A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information.
The framework is flexible, scalable, and can deal with undirected/directed, weighted/unweighted graphs.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Graph embedding is a transformation of nodes of a network into a set of
vectors. A good embedding should capture the underlying graph topology and
structure, node-to-node relationship, and other relevant information about the
graph, its subgraphs, and nodes themselves. If these objectives are achieved,
an embedding is a meaningful, understandable, and often compressed
representation of a network. Unfortunately, selecting the best embedding is a
challenging task and very often requires domain experts. In this paper, we
extend the framework for evaluating graph embeddings that was recently
introduced by the authors. Now, the framework assigns two scores, local and
global, to each embedding that measure the quality of an evaluated embedding
for tasks that require good representation of local and, respectively, global
properties of the network. The best embedding, if needed, can be selected in an
unsupervised way, or the framework can identify a few embeddings that are worth
further investigation. The framework is flexible, scalable, and can deal with
undirected/directed, weighted/unweighted graphs.
Related papers
- DGNN: Decoupled Graph Neural Networks with Structural Consistency
between Attribute and Graph Embedding Representations [62.04558318166396]
Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures.
A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes.
Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
arXiv Detail & Related papers (2024-01-28T06:43:13Z) - Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - Network Alignment with Transferable Graph Autoencoders [79.89704126746204]
We propose a novel graph autoencoder architecture designed to extract powerful and robust node embeddings.
We prove that the generated embeddings are associated with the eigenvalues and eigenvectors of the graphs.
Our proposed framework also leverages transfer learning and data augmentation to achieve efficient network alignment at a very large scale without retraining.
arXiv Detail & Related papers (2023-10-05T02:58:29Z) - Unsupervised Framework for Evaluating and Explaining Structural Node
Embeddings of Graphs [2.539920413471809]
An embedding is a mapping from a set of nodes of a network into a real vector space.
For classical embeddings there exists a framework which helps data scientists to identify (in an unsupervised way) a few embeddings that are worth further investigation.
In this paper we propose a framework for unsupervised ranking of structural graph embeddings.
arXiv Detail & Related papers (2023-06-19T08:27:02Z) - 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) - Temporal Graph Network Embedding with Causal Anonymous Walks
Representations [54.05212871508062]
We propose a novel approach for dynamic network representation learning based on Temporal Graph Network.
For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings.
We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
arXiv Detail & Related papers (2021-08-19T15:39:52Z) - 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) - Evaluating Node Embeddings of Complex Networks [0.0]
Agood embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph.
The main challenge is that one needs to make sure that embeddings describe the properties of the graphs well.
We do a series of experiments with selected graph embedding algorithms, both on real-world networks as well as artificially generated ones.
arXiv Detail & Related papers (2021-02-16T16:55:29Z)
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.