Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hashemi, Alireza, Makse, Hernan
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2301.10960
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911883934564352
author Hashemi, Alireza
Makse, Hernan
author_facet Hashemi, Alireza
Makse, Hernan
contents We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its immediate neighboring nodes, we also include more distant nodes in the calculations. In experimenting with a number of publicly available citation graph datasets, we show that this higher order neighbor visiting pays off by outperforming the original model especially when we have a limited number of available labeled data points for the training of the model.
format Preprint
id arxiv_https___arxiv_org_abs_2301_10960
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Visiting Distant Neighbors in Graph Convolutional Networks
Hashemi, Alireza
Makse, Hernan
Machine Learning
Social and Information Networks
We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its immediate neighboring nodes, we also include more distant nodes in the calculations. In experimenting with a number of publicly available citation graph datasets, we show that this higher order neighbor visiting pays off by outperforming the original model especially when we have a limited number of available labeled data points for the training of the model.
title Visiting Distant Neighbors in Graph Convolutional Networks
topic Machine Learning
Social and Information Networks
url https://arxiv.org/abs/2301.10960