SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks
Graph neural networks (GNNs) work well when the graph structure is provided. However, this structure may not always be available in real-world applications. One solution to this problem is to infer a task-specific latent structure and then apply a GNN to the inferred graph. Unfortunately, the space of possible graph structures grows super-exponentially with the number of nodes and so the task-specific supervision may be insufficient for learning both the structure and the GNN parameters. In this work, we propose the Simultaneous Learning of Adjacency and GNN Parameters with Self-supervision, or SLAPS, a method that provides more supervision for inferring a graph structure through self-supervision. A comprehensive experimental study demonstrates that SLAPS scales to large graphs with hundreds of thousands of nodes and outperforms several models that have been proposed to learn a task-specific graph structure on established benchmarks.
Code (1)
Tasks
Graph structure learningSimilar Papers 제목 키워드 기반
Deep Slap Fingerprint Segmentation for Juveniles and Adults
Many fingerprint recognition systems capture four fingerprints in one image. In such systems, the fingerprint processing pipeline must first segment each four-fingerprint slap into individual fingerprints. Note that most…
SegmentationSelf-supervised Auxiliary Learning for Graph Neural Networks via Meta-Learning
In recent years, graph neural networks (GNNs) have been widely adopted in the representation learning of graph-structured data and provided state-of-the-art performance in various applications such as link prediction, no…
Auxiliary LearningGraph Neural NetworkLink PredictionMeta-Learning+3Multi-task Self-distillation for Graph-based Semi-Supervised Learning
Graph convolutional networks have made great progress in graph-based semi-supervised learning. Existing methods mainly assume that nodes connected by graph edges are prone to have similar attributes and labels, so that t…
Node ClassificationDeep Attention-guided Graph Clustering with Dual Self-supervision
Existing deep embedding clustering works only consider the deepest layer to learn a feature embedding and thus fail to well utilize the available discriminative information from cluster assignments, resulting performance…
ClusteringDeep AttentionGraph ClusteringTripletHeMI: Multi-view Embedding in Heterogeneous Graphs
Many real-world graphs involve different types of nodes and relations between nodes, being heterogeneous by nature. The representation learning of heterogeneous graphs (HGs) embeds the rich structure and semantics of suc…
ClusteringLink PredictionNode ClassificationNode Clustering+1