Graph Pooling by Edge Cut
Graph neural networks (GNNs) are very efficient at solving several tasks in graphs such as node classification or graph classification. They come from an adaptation of convolutional neural networks on images to graph structured data. These models are very effective at finding patterns in images that can discriminate images from each others. Another aspect leading to their success is their ability to uncover hierarchical structures. This comes from the pooling operation that produces different versions of the input image at different scales. The same way, we want to identify patterns at different scales in graphs in order to improve the classification accuracy. Compared to the case of images, it is not trivial to develop a pooling layer on graphs. This is mainly due to the fact that in graphs nodes are not ordered and have irregular neighborhoods. To aleviate this issue, we propose a pooling layer based on edge cuts in graphs. This pooling layer works by computing edge scores that correspond to the importance of edges in the process of information propagation of the GNN. Moreover, we define a regularization function that aims at producing edge scores that minimize the minCUT problem. Finally, through extensive experiments we show that this architecture can compete with state-of- the-art methods.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationGraph ClassificationNode ClassificationSimilar Papers 제목 키워드 기반
Edge Contraction Pooling for Graph Neural Networks
Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups o…
General ClassificationGraph ClassificationGraph Neural NetworkEdge but not Least: Cross-View Graph Pooling
Graph neural networks have emerged as a powerful model for graph representation learning to undertake graph-level prediction tasks. Various graph pooling methods have been developed to coarsen an input graph into a succi…
Graph ClassificationGraph RegressionGraph Representation LearningRepresentation LearningContext Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs
Recent investigations on the effectiveness of Graph Neural Network (GNN)-based models for link prediction in Knowledge Graphs (KGs) show that vanilla aggregation does not significantly impact the model performance. In th…
Inductive Link PredictionGraph Neural NetworkKnowledge GraphsSeeing All From a Few: Nodes Selection Using Graph Pooling for Graph Clustering
Recently, there has been considerable research interest in graph clustering aimed at data partition using the graph information. However, one limitation of the most of graph-based methods is that they assume the graph st…
AllClusteringGraph ClusteringGraph Embedding+1Edge-aware Hard Clustering Graph Pooling for Brain Imaging
Graph Convolutional Networks (GCNs) can capture non-Euclidean spatial dependence between different brain regions. The graph pooling operator, a crucial element of GCNs, enhances the representation learning capability and…
ClusteringGraph ClusteringRepresentation Learning