Is Graph Convolution Always Beneficial For Every Feature?
Yilun Zheng, Xiang Li, Sitao Luan, Xiaojiang Peng, Lihui Chen

TL;DR
This paper introduces a new metric, TFI, to identify beneficial features for GNNs and proposes a feature selection method, GFS, which significantly improves GNN performance across multiple datasets and architectures.
Contribution
The paper presents TFI, a novel metric for feature selection in GNNs, and GFS, a method that enhances GNN performance by separating GNN-favored and disfavored features.
Findings
GFS improves performance in 83.75% of cases across 10 datasets.
TFI outperforms existing feature selection metrics.
GFS is robust to hyperparameter tuning.
Abstract
Graph Neural Networks (GNNs) have demonstrated strong capabilities in processing structured data. While traditional GNNs typically treat each feature dimension equally during graph convolution, we raise an important question: Is the graph convolution operation equally beneficial for each feature? If not, the convolution operation on certain feature dimensions can possibly lead to harmful effects, even worse than the convolution-free models. In prior studies, to assess the impacts of graph convolution on features, people proposed metrics based on feature homophily to measure feature consistency with the graph topology. However, these metrics have shown unsatisfactory alignment with GNN performance and have not been effectively employed to guide feature selection in GNNs. To address these limitations, we introduce a novel metric, Topological Feature Informativeness (TFI), to distinguish…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Visualization and Analytics · Graph Theory and Algorithms · Advanced Graph Neural Networks
MethodsFeature Selection · Convolution
