Feature Selection and Extraction for Graph Neural Networks
Deepak Bhaskar Acharya, Huaming Zhang

TL;DR
This paper extends feature selection and ranking algorithms to Graph Neural Networks, demonstrating their effectiveness on benchmark datasets for improving classification accuracy and interpretability.
Contribution
It introduces a Gumbel Softmax-based feature selection method for GNNs and a feature ranking mechanism, validated on standard datasets.
Findings
Selected 225 features out of 1433 on Cora dataset.
Extracted features as non-negative linear combinations of original features.
Ranking of features correlates with classification accuracy degradation.
Abstract
Graph Neural Networks (GNNs) have been a latest hot research topic in data science, due to the fact that they use the ubiquitous data structure graphs as the underlying elements for constructing and training neural networks. In a GNN, each node has numerous features associated with it. The entire task (for example, classification, or clustering) utilizes the features of the nodes to make decisions, at node level or graph level. In this paper, (1) we extend the feature selection algorithm presented in via Gumbel Softmax to GNNs. We conduct a series of experiments on our feature selection algorithms, using various benchmark datasets: Cora, Citeseer and Pubmed. (2) We implement a mechanism to rank the extracted features. We demonstrate the effectiveness of our algorithms, for both feature selection and ranking. For the Cora dataset, (1) we use the algorithm to select 225 features out of…
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
MethodsFeature Selection · Gumbel Softmax · Softmax
