Deep 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 and corresponding high-level summaries of graphs---both derived using established graph convolutional network architectures. The learnt patch representations summarize subgraphs centered around nodes of interest, and can thus be reused for downstream node-wise learning tasks. In contrast to most prior approaches to unsupervised learning with GCNs, DGI does not rely on random walk objectives, and is readily applicable to both transductive and inductive learning setups. We demonstrate competitive performance on a variety of node classification benchmarks, which at times even exceeds the performance of supervised learning.
Code (11)
Tasks
General ClassificationInductive LearningNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Embedding Using Infomax for ASD Classification and Brain Functional Difference Detection
Significant progress has been made using fMRI to characterize the brain changes that occur in ASD, a complex neuro-developmental disorder. However, due to the high dimensionality and low signal-to-noise ratio of fMRI, em…
ClassificationGeneral ClassificationGraph EmbeddingGraph Neural NetworkGraph Pooling via Coarsened Graph Infomax
Graph pooling that summaries the information in a large graph into a compact form is essential in hierarchical graph representation learning. Existing graph pooling methods either suffer from high computational complexit…
Contrastive LearningGraph Representation LearningRepresentation LearningEmpowering Graph Invariance Learning with Deep Spurious Infomax
Recently, there has been a surge of interest in developing graph neural networks that utilize the invariance principle on graphs to generalize the out-of-distribution (OOD) data. Due to the limited knowledge about OOD da…
Inductive BiasLearning 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 p…
COIN: Co-Cluster Infomax for Bipartite Graphs
Bipartite graphs are powerful data structures to model interactions between two types of nodes, which have been used in a variety of applications, such as recommender systems, information retrieval, and drug discovery. A…
Drug DiscoveryInformation RetrievalRecommendation SystemsRetrieval+1