Multi-duplicated Characterization of Graph Structures using Information Gain Ratio for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Various graph neural networks (GNNs) have been proposed to solve node classification tasks in machine learning for graph data. GNNs use the structural information of graph data by aggregating the features of neighboring nodes. However, they fail to directly characterize and leverage the structural information. In this paper, we propose multi-duplicated characterization of graph structures using information gain ratio (IGR) for GNNs (MSI-GNN), which enhances the performance of node classification by using an i-hop adjacency matrix as the structural information of the graph data. In MSI-GNN, the i-hop adjacency matrix is adaptively adjusted by two methods: (i) structural features in the matrix are selected based on the IGR, and (ii) the selected features in (i) for each node are duplicated and combined flexibly. In an experiment, we show that our MSI-GNN outperforms GCN, H2GCN, and GCNII in terms of average accuracies in benchmark graph datasets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 47 references that are in the map. First posted on arXiv 24 Dec 2022.
Builds on
33 of 47 references.
References · 33
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
21 more
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 396
- 2018Deep Learning on Graphs: A Surveycited by 393
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2018Graph Convolutional Networks for Text Classificationcited by 345
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 214
- 2019Semantic Graph Convolutional Networks for 3D Human Pose Regressioncited by 204
- 2020Graph Neural Networks with Heterophilycited by 202
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2020Unifying Graph Convolutional Neural Networks and Label Propagationcited by 98
- 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
- 2021Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Frameworkcited by 69
- 2022Skip Vectors for RDF Data: Extraction Based on the Complexity of Feature Patternscited by 2
Built on by
Not cited yet.