Multi-duplicated Characterization of Graph Structures using Information Gain Ratio for Graph Neural Networks
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 i...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.48550/arxiv.2212.12691 |