Multi-Task Graph Autoencoders
원문 초록
We examine two fundamental tasks associated with graph representation learning: link prediction and node classification. We present a new autoencoder architecture capable of learning a joint representation of local graph structure and available node features for the simultaneous multi-task learning of unsupervised link prediction and semi-supervised node classification. Our simple, yet effective and versatile model is efficiently trained end-to-end in a single stage, whereas previous related deep graph embedding methods require multiple training steps that are difficult to optimize. We provide an empirical evaluation of our model on five benchmark relational, graph-structured datasets and demonstrate significant improvement over three strong baselines for graph representation learning. Reference code and data are available at https://github.com/vuptran/graph-representation-learning
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion
HGATE: Heterogeneous Graph Attention Auto-Encoders
토론
이 논문과 연결된 포럼 글이 아직 없습니다.