Pair-view Unsupervised Graph Representation Learning
- URL: http://arxiv.org/abs/2012.06113v1
- Date: Fri, 11 Dec 2020 04:09:47 GMT
- Title: Pair-view Unsupervised Graph Representation Learning
- Authors: You Li, Binli Luo, Ning Gui
- Abstract summary: Low-dimension graph embeddings have proved extremely useful in various downstream tasks in large graphs.
This paper pro-poses PairE, a solution to use "pair", a higher level unit than a "node" as the core for graph embeddings.
Experiment results show that PairE consistently outperforms the state of baselines in all four downstream tasks.
- Score: 2.8650714782703366
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Low-dimension graph embeddings have proved extremely useful in various
downstream tasks in large graphs, e.g., link-related content recommendation and
node classification tasks, etc. Most existing embedding approaches take nodes
as the basic unit for information aggregation, e.g., node perception fields in
GNN or con-textual nodes in random walks. The main drawback raised by such
node-view is its lack of support for expressing the compound relationships
between nodes, which results in the loss of a certain degree of graph
information during embedding. To this end, this paper pro-poses PairE(Pair
Embedding), a solution to use "pair", a higher level unit than a "node" as the
core for graph embeddings. Accordingly, a multi-self-supervised auto-encoder is
designed to fulfill two pretext tasks, to reconstruct the feature distribution
for respective pairs and their surrounding context. PairE has three major
advantages: 1) Informative, embedding beyond node-view are capable to preserve
richer information of the graph; 2) Simple, the solutions provided by PairE are
time-saving, storage-efficient, and require the fewer hyper-parameters; 3) High
adaptability, with the introduced translator operator to map pair embeddings to
the node embeddings, PairE can be effectively used in both the link-based and
the node-based graph analysis. Experiment results show that PairE consistently
outperforms the state of baselines in all four downstream tasks, especially
with significant edges in the link-prediction and multi-label node
classification tasks.
Related papers
- GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy [21.553180564868306]
GraphRARE is a framework built upon node relative entropy and deep reinforcement learning.
An innovative node relative entropy is used to measure mutual information between node pairs.
A deep reinforcement learning-based algorithm is developed to optimize the graph topology.
arXiv Detail & Related papers (2023-12-15T11:30:18Z) - On Exploring Node-feature and Graph-structure Diversities for Node Drop
Graph Pooling [86.65151066870739]
Current node drop pooling methods ignore the graph diversity in terms of the node features and the graph structures, thus resulting in suboptimal graph-level representations.
We propose a novel plug-and-play score scheme and refer to it as MID, which consists of a textbfMulti score space with two operations, textiti.e., fltextbfIpscore and textbfDropscore.
Specifically, the multidimensional score space depicts the significance of nodes through multiple criteria; the flipscore encourages the maintenance of dissimilar node
arXiv Detail & Related papers (2023-06-22T08:02:01Z) - 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) - Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by
Identifying Important Nodes with Bridgeness [19.448849238643582]
unsupervised node embedding methods such as DeepWalk, LINE, struc2vec, PTE, UserItem2vec, and RWJBG have emerged from the Skip-gram model.
In this paper, we show that global explanations to the Skip-gram-based embeddings can be found by computing bridgeness under a spectral cluster-aware local perturbation.
A novel gradient-based explanation method, which we call GRAPH-wGD, is proposed that allows the top-q global explanations about learned graph embedding vectors more efficiently.
arXiv Detail & Related papers (2023-04-24T12:25:35Z) - Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks [14.41064333206723]
We propose textlabeling trick, which first labels nodes in the graph according to their relationships with the target node set before applying a GNN.
Our work explains the superior performance of previous node-labeling-based methods and establishes a theoretical foundation for using GNNs for multi-node representation learning.
arXiv Detail & Related papers (2023-04-20T04:03:40Z) - 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) - Graph Representation Learning Beyond Node and Homophily [2.8417100723094357]
This paper proposes PairE, a novel unsupervised graph embedding method using two paired nodes.
A multi-self-supervised autoencoder is designed to fulfill two pretext tasks: one retains the high-frequency signal better, and another enhances the representation of commonality.
Our experiments show that PairE outperforms the unsupervised state-of-the-art baselines.
arXiv Detail & Related papers (2022-03-03T08:27:09Z) - Reasoning Graph Networks for Kinship Verification: from Star-shaped to
Hierarchical [85.0376670244522]
We investigate the problem of facial kinship verification by learning hierarchical reasoning graph networks.
We develop a Star-shaped Reasoning Graph Network (S-RGN) to exploit more powerful and flexible capacity.
We also develop a Hierarchical Reasoning Graph Network (H-RGN) to exploit more powerful and flexible capacity.
arXiv Detail & Related papers (2021-09-06T03:16:56Z) - Accurate Learning of Graph Representations with Graph Multiset Pooling [45.72542969364438]
We propose a Graph Multiset Transformer (GMT) that captures the interaction between nodes according to their structural dependencies.
Our experimental results show that GMT significantly outperforms state-of-the-art graph pooling methods on graph classification benchmarks.
arXiv Detail & Related papers (2021-02-23T07:45:58Z) - CatGCN: Graph Convolutional Networks with Categorical Node Features [99.555850712725]
CatGCN is tailored for graph learning when the node features are categorical.
We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification.
arXiv Detail & Related papers (2020-09-11T09:25:17Z) - 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.