REVIEW 6 cited by
Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Graph convolutional networks (GCNs) have been successfully applied in node classification tasks of network mining. However, most of these models based on neighborhood aggregation are usually shallow and lack the "graph pooling" mechanism, which prevents the model from obtaining adequate global information. In order to increase the receptive field, we propose a novel deep Hierarchical Graph Convolutional Network (H-GCN) for semi-supervised node classification. H-GCN first repeatedly aggregates structurally similar nodes to hyper-nodes and then refines the coarsened graph to the original to restore the representation for each node. Instead of merely aggregating one- or two-hop neighborhood information, the proposed coarsening procedure enlarges the receptive field for each node, hence more global information can be captured. The proposed H-GCN model shows strong empirical performance on various public benchmark graph datasets, outperforming state-of-the-art methods and acquiring up to 5.9% performance improvement in terms of accuracy. In addition, when only a few labeled samples are provided, our model gains substantial improvements.
Forward citations
Cited by 6 Pith papers
-
DeltaGNN: Graph Neural Network with Information Flow Control
DeltaGNN introduces a linear-time, embedding-derived information flow score for edge filtering and uses it to mitigate over-smoothing and over-squashing in semi-supervised node classification.
-
Graph-Aware Isomorphic Attention for Adaptive Dynamics in Transformers
GIN-style graph aggregation inside Transformer attention and during fine-tuning improves validation perplexity and generalization compared with standard attention and LoRA in the tested settings.
-
Learn Beneficial Noise as Graph Augmentation
PiNGDA learns beneficial noise on graph topology and attributes via a trainable generator, framing standard graph contrastive learning as a point estimate of positive-incentive noise.
-
A Hybrid Real-Time Framework for Efficient Fussell-Vesely Importance Evaluation Using Virtual Fault Trees and Graph Neural Networks
An ISM-based virtual fault tree and a graph convolutional network are combined to predict Fussell-Vesely importance on two small nuclear subsystems, with claims of millisecond inference and high accuracy.
-
EdgeGFL: Rethinking Edge Information in Graph Feature Preference Learning
EdgeGFL multiplies node messages by learned edge-type vectors to implement per-dimension feature preference in heterogeneous graph neural networks, reporting small gains over prior GNN baselines.
-
Graph Representation Learning: A Survey
A survey of graph embedding methods with a small benchmark comparison of seven methods on citation and social network data, and an advertised code library that is not provided.
Discussion (0). Continue with ORCID to comment.