MxPool: Multiplex Pooling for Hierarchical Graph Representation Learning
How to utilize deep learning methods for graph classification tasks has attracted considerable research attention in the past few years. Regarding graph classification tasks, the graphs to be classified may have various graph sizes (i.e., different number of nodes and edges) and have various graph properties (e.g., average node degree, diameter, and clustering coefficient). The diverse property of graphs has imposed significant challenges on existing graph learning techniques since diverse graphs have different best-fit hyperparameters. It is difficult to learn graph features from a set of diverse graphs by a unified graph neural network. This motivates us to use a multiplex structure in a diverse way and utilize a priori properties of graphs to guide the learning. In this paper, we propose MxPool, which concurrently uses multiple graph convolution/pooling networks to build a hierarchical learning structure for graph representation learning tasks. Our experiments on numerous graph classification benchmarks show that our MxPool has superiority over other state-of-the-art graph representation learning methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationClusteringGeneral ClassificationGraph ClassificationGraph LearningGraph Neural NetworkGraph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
A Geometric Perspective for High-Dimensional Multiplex Graphs
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant c…
Graph EmbeddingGraph Pooling with Node Proximity for Hierarchical Representation Learning
Graph neural networks have attracted wide attentions to enable representation learning of graph data in recent works. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical rep…
Graph ClassificationRepresentation LearningCommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning
Recent years have witnessed the emergence and flourishing of hierarchical graph pooling neural networks (HGPNNs) which are effective graph representation learning approaches for graph level tasks such as graph classifica…
Graph ClassificationGraph Representation LearningRepresentation LearningHierarchical Graph Pooling with Structure Learning
Graph Neural Networks (GNNs), which generalize deep neural networks to graph-structured data, have drawn considerable attention and achieved state-of-the-art performance in numerous graph related tasks. However, existing…
Graph ClassificationGraph Neural NetworkRepresentation LearningHierarchical Aggregations for High-Dimensional Multiplex Graph Embedding
We investigate the problem of multiplex graph embedding, that is, graphs in which nodes interact through multiple types of relations (dimensions). In recent years, several methods have been developed to address this prob…
Graph EmbeddingLink PredictionNode Classification