Learning Representations of Partial Subgraphs by Subgraph InfoMax
Subgraphs are important substructures of graphs, but learning their representations has not been studied well. Particularly, when we have partial subgraphs, existing node- or subgraph-level message-passing is likely to produce suboptimal representations. In this paper, we propose Intra- and Inter-Subgraph InfoMax, a model that learns subgraph representations under incomplete observation. Our model employs subgraph summaries at two different levels while maximizing the mutual information between the subgraph summaries and the node representations. By doing so, we reconstruct the representation of the underlying subgraph and improve its expressiveness from different angles of the local-global structure. We conduct experiments on three real-world datasets under training and evaluation protocols designed for this problem. Experimental results show that our model outperforms baselines in all settings.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Models and Benchmarks for Representation Learning of Partially Observed Subgraphs
Subgraphs are rich substructures in graphs, and their nodes and edges can be partially observed in real-world tasks. Under partial observation, existing node- or subgraph-level message-passing produces suboptimal represe…
Representation LearningSubgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs
Inductive link prediction for knowledge graph aims at predicting missing links between unseen entities, those not shown in training stage. Most previous works learn entity-specific embeddings of entities, which cannot ha…
Inductive Link PredictionKnowledge GraphsLink PredictionDeep Graph Infomax
We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner. DGI relies on maximizing mutual information between patch representations …
General ClassificationInductive LearningNode ClassificationLearning Invariant Graph Representations Through Redundant Information
Learning invariant graph representations for out-of-distribution (OOD) generalization remains challenging because the learned representations often retain spurious components. To address this challenge, this work introdu…
Representation LearningGraph LearningTranslating Subgraphs to Nodes Makes Simple GNNs Strong and Efficient for Subgraph Representation Learning
Subgraph representation learning has emerged as an important problem, but it is by default approached with specialized graph neural networks on a large global graph. These models demand extensive memory and computational…
Representation LearningTranslation