Unsupervised Graph Representation by Periphery and Hierarchical Information Maximization
Deep representation learning on non-Euclidean data types, such as graphs, has gained significant attention in recent years. Invent of graph neural networks has improved the state-of-the-art for both node and the entire graph representation in a vector space. However, for the entire graph representation, most of the existing graph neural networks are trained on a graph classification loss in a supervised way. But obtaining labels of a large number of graphs is expensive for real world applications. Thus, we aim to propose an unsupervised graph neural network to generate a vector representation of an entire graph in this paper. For this purpose, we combine the idea of hierarchical graph neural networks and mutual information maximization into a single framework. We also propose and use the concept of periphery representation of a graph and show its usefulness in the proposed algorithm which is referred as GraPHmax. We conduct thorough experiments on several real-world graph datasets and compare the performance of GraPHmax with a diverse set of both supervised and unsupervised baseline algorithms. Experimental results show that we are able to improve the state-of-the-art for multiple graph level tasks on several real-world datasets, while remain competitive on the others.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationGraph Neural NetworkRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Robust Core-Periphery Constrained Transformer for Domain Adaptation
Unsupervised domain adaptation (UDA) aims to learn transferable representation across domains. Recently a few UDA works have successfully applied Transformer-based methods and achieved state-of-the-art (SOTA) results. Ho…
Domain AdaptationUnsupervised Domain AdaptationHierarchical graph sampling based minibatch learning with chain preservation and variance reduction
Graph sampling based Graph Convolutional Networks (GCNs) decouple the sampling from the forward and backward propagation during minibatch training, which exhibit good scalability in terms of layer depth and graph size. W…
Graph SamplingNode ClassificationUnsupervised Hierarchical Graph Representation Learning by Mutual Information Maximization
Graph representation learning based on graph neural networks (GNNs) can greatly improve the performance of downstream tasks, such as node and graph classification. However, the general GNN models do not aggregate node in…
General ClassificationGraph ClassificationGraph Representation LearningRepresentation LearningLearning Hierarchical Integration of Foveal and Peripheral Vision for Vergence Control by Active Efficient Coding
The active efficient coding (AEC) framework parsimoniously explains the joint development of visual processing and eye movements, e.g., the emergence of binocular disparity selective neurons and fusional vergence, the di…
Learning Sparse Graphs with a Core-periphery Structure
In this paper, we focus on learning sparse graphs with a core-periphery structure. We propose a generative model for data associated with core-periphery structured networks to model the dependence of node attributes on c…