Edge Partition Modulated Graph Convolutional Networks
Graph convolutional networks (GCNs), which propagate the node features through the edges and learn how to transform the aggregated features under label supervision, have achieved great success in supervised feature extraction for both graph-level and node-level classification tasks. However, GCNs typically treat the graph adjacency matrix as given and ignore how the edges could be formed by different latent inter-node relations. In this paper, we introduce a relational graph generative process to model how the observed edges are generated by aggregating the node interactions over multiple overlapping node communities, each of which represents a particular type of relation that contributes to the edges via a logical OR mechanism. Based on this relational generative model, we partition each edge into the summation of multiple relation-specific weighted edges, and use the weighted edges in each community to define a relation-specific GCN. We introduce a variational inference framework to jointly learn how to partition the edges into different communities and combine relation-specific GCNs for the end classification tasks. Extensive evaluations on real-world datasets have demonstrated the working mechanisms of the edge partition modulated GCNs and their efficacy in learning both node and graph-level representations.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationVariational InferenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Modulated Graph Convolutional Network for 3D Human Pose Estimation
The graph convolutional network (GCN) has recently achieved promising performance of 3D human pose estimation (HPE) by modeling the relationship among body parts. However, most prior GCN approaches suffer from two ma…
3D Human Pose EstimationPose EstimationDeep Learning and Spectral Embedding for Graph Partitioning
We present a graph bisection and partitioning algorithm based on graph neural networks. For each node in the graph, the network outputs probabilities for each of the partitions. The graph neural network consists of two m…
Deep LearningGraph Neural Networkgraph partitioningLearning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks
The minimum cost multicut problem is the NP-hard/APX-hard combinatorial optimization problem of partitioning a real-valued edge-weighted graph such as to minimize the total cost of the partition. While graph convolutiona…
Combinatorial OptimizationCPa-WAC: Constellation Partitioning-based Scalable Weighted Aggregation Composition for Knowledge Graph Embedding
Scalability and training time are crucial for any graph neural network model processing a knowledge graph (KG). While partitioning knowledge graphs helps reduce the training time, the prediction accuracy reduces signifca…
Graph EmbeddingGraph Neural NetworkKnowledge Graph CompletionKnowledge Graph Embedding+1Grids versus Graphs: Partitioning Space for Improved Taxi Demand-Supply Forecasts
Accurate taxi demand-supply forecasting is a challenging application of ITS (Intelligent Transportation Systems), due to the complex spatial and temporal patterns. We investigate the impact of different spatial partition…
Ensemble Learning