Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification

TL;DR

This paper introduces CorGCN, a novel graph neural network that explicitly models label correlations and reduces ambiguity in multi-label node classification, leading to improved accuracy.

Contribution

The paper proposes a correlation-aware GCN with a new graph decomposition and message passing method to better capture label relationships in multi-label classification.

Findings

CorGCN outperforms existing methods on five datasets.

The approach effectively models label correlations.

Reduces ambiguity in multi-label graph data.

Abstract

Multi-label node classification is an important yet under-explored domain in graph mining as many real-world nodes belong to multiple categories rather than just a single one. Although a few efforts have been made by utilizing Graph Convolution Networks (GCNs) to learn node representations and model correlations between multiple labels in the embedding space, they still suffer from the ambiguous feature and ambiguous topology induced by multiple labels, which reduces the credibility of the messages delivered in graphs and overlooks the label correlations on graph data. Therefore, it is crucial to reduce the ambiguity and empower the GCNs for accurate classification. However, this is quite challenging due to the requirement of retaining the distinctiveness of each label while fully harnessing the correlation between labels simultaneously. To address these issues, in this paper, we propose a Correlation-aware Graph Convolutional Network (CorGCN) for multi-label node classification. By introducing a novel Correlation-Aware Graph Decomposition module, CorGCN can learn a graph that contains rich label-correlated information for each label. It then employs a Correlation-Enhanced Graph Convolution to model the relationships between labels during message passing to further bolster the classification process. Extensive experiments on five datasets demonstrate the effectiveness of our proposed CorGCN.