Papers › Graph Node-Feature Convolution for Representation Learning

Graph Node-Feature Convolution for Representation Learning

30 Nov 2018arXiv:1812.00086archive 2025-07-28

Li Zhang, Heda Song, Nikolaos Aletras, Haiping Lu

Graph convolutional network (GCN) is an emerging neural network approach. It learns new representation of a node by aggregating feature vectors of all neighbors in the aggregation process without considering whether the neighbors or features are useful or not. Recent methods have improved solutions by sampling a fixed size set of neighbors, or assigning different weights to different neighbors in the aggregation process, but features within a feature vector are still treated equally in the aggregation process. In this paper, we introduce a new convolution operation on regular size feature maps constructed from features of a fixed node bandwidth via sampling to get the first-level node representation, which is then passed to a standard GCN to learn the second-level node representation. Experiments show that our method outperforms competing methods in semi-supervised node classification tasks. Furthermore, our method opens new doors for exploring new GCN architectures, particularly deeper GCN models.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

asarigun/nfc mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Revisiting Semi-Supervised Learning with Graph Embeddings (arXiv:1603.08861; that paper's own run record: 15 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report
asarigun/nfc-gcn mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Revisiting Semi-Supervised Learning with Graph Embeddings (arXiv:1603.08861; that paper's own run record: 15 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Node ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ConvolutionGCN

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections