AttrE2vec: Unsupervised Attributed Edge Representation Learning
- URL: http://arxiv.org/abs/2012.14727v1
- Date: Tue, 29 Dec 2020 12:20:49 GMT
- Title: AttrE2vec: Unsupervised Attributed Edge Representation Learning
- Authors: Piotr Bielak, Tomasz Kajdanowicz, Nitesh V. Chawla
- Abstract summary: This paper proposes a novel unsupervised inductive method called AttrE2Vec, which learns a low-dimensional vector representation for edges in attributed networks.
Experimental results show that, compared to contemporary approaches, our method builds more powerful edge vector representations.
- Score: 22.774159996012276
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Representation learning has overcome the often arduous and manual
featurization of networks through (unsupervised) feature learning as it results
in embeddings that can apply to a variety of downstream learning tasks. The
focus of representation learning on graphs has focused mainly on shallow
(node-centric) or deep (graph-based) learning approaches. While there have been
approaches that work on homogeneous and heterogeneous networks with multi-typed
nodes and edges, there is a gap in learning edge representations. This paper
proposes a novel unsupervised inductive method called AttrE2Vec, which learns a
low-dimensional vector representation for edges in attributed networks. It
systematically captures the topological proximity, attributes affinity, and
feature similarity of edges. Contrary to current advances in edge embedding
research, our proposal extends the body of methods providing representations
for edges, capturing graph attributes in an inductive and unsupervised manner.
Experimental results show that, compared to contemporary approaches, our method
builds more powerful edge vector representations, reflected by higher quality
measures (AUC, accuracy) in downstream tasks as edge classification and edge
clustering. It is also confirmed by analyzing low-dimensional embedding
projections.
Related papers
- GASE: Graph Attention Sampling with Edges Fusion for Solving Vehicle Routing Problems [6.084414764415137]
We propose an adaptive Graph Attention Sampling with the Edges Fusion framework to solve vehicle routing problems.
Our proposed model outperforms the existing methods by 2.08%-6.23% and shows stronger generalization ability.
arXiv Detail & Related papers (2024-05-21T03:33:07Z) - PENet: A Joint Panoptic Edge Detection Network [9.115443186505958]
We propose PENet, a novel detection network that combines semantic edge detection and instance-level perception into a compact panoptic edge representation.
We validate the proposed panoptic edge segmentation method and demonstrate its effectiveness on the real-world Cityscapes dataset.
arXiv Detail & Related papers (2023-03-15T18:01:01Z) - Refined Edge Usage of Graph Neural Networks for Edge Prediction [51.06557652109059]
We propose a novel edge prediction paradigm named Edge-aware Message PassIng neuRal nEtworks (EMPIRE)
We first introduce an edge splitting technique to specify use of each edge where each edge is solely used as either the topology or the supervision.
In order to emphasize the differences between pairs connected by supervision edges and pairs unconnected, we further weight the messages to highlight the relative ones that can reflect the differences.
arXiv Detail & Related papers (2022-12-25T23:19:56Z) - Beyond Smoothing: Unsupervised Graph Representation Learning with Edge
Heterophily Discriminating [40.916070587912785]
We propose a novel unsupervised Graph Representation learning method with Edge hEterophily discriminaTing (GREET)
GREET learns representations by discriminating and leveraging homophilic edges and heterophilic edges.
We conducted extensive experiments on 14 benchmark datasets and multiple learning scenarios to demonstrate the superiority of GRET.
arXiv Detail & Related papers (2022-11-25T12:39:41Z) - Learnable Graph Convolutional Network and Feature Fusion for Multi-view
Learning [30.74535386745822]
This paper proposes a joint deep learning framework called Learnable Graph Convolutional Network and Feature Fusion (LGCN-FF)
It consists of two stages: feature fusion network and learnable graph convolutional network.
The proposed LGCN-FF is validated to be superior to various state-of-the-art methods in multi-view semi-supervised classification.
arXiv Detail & Related papers (2022-11-16T19:07:12Z) - Interpolation-based Correlation Reduction Network for Semi-Supervised
Graph Learning [49.94816548023729]
We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN)
In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries.
By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
arXiv Detail & Related papers (2022-06-06T14:26:34Z) - LEAD: Self-Supervised Landmark Estimation by Aligning Distributions of
Feature Similarity [49.84167231111667]
Existing works in self-supervised landmark detection are based on learning dense (pixel-level) feature representations from an image.
We introduce an approach to enhance the learning of dense equivariant representations in a self-supervised fashion.
We show that having such a prior in the feature extractor helps in landmark detection, even under drastically limited number of annotations.
arXiv Detail & Related papers (2022-04-06T17:48:18Z) - 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) - Visualization of Supervised and Self-Supervised Neural Networks via
Attribution Guided Factorization [87.96102461221415]
We develop an algorithm that provides per-class explainability.
In an extensive battery of experiments, we demonstrate the ability of our methods to class-specific visualization.
arXiv Detail & Related papers (2020-12-03T18:48:39Z) - Weakly-Supervised Semantic Segmentation by Iterative Affinity Learning [86.45526827323954]
Weakly-supervised semantic segmentation is a challenging task as no pixel-wise label information is provided for training.
We propose an iterative algorithm to learn such pairwise relations.
We show that the proposed algorithm performs favorably against the state-of-the-art methods.
arXiv Detail & Related papers (2020-02-19T10:32:03Z)
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.