GraphHop: An Enhanced Label Propagation Method for Node Classification
Tian Xie, Bin Wang, C.-C. Jay Kuo

TL;DR
GraphHop is a scalable semi-supervised node classification method that iteratively propagates labels on large graphs, outperforming existing methods especially with very few labeled nodes.
Contribution
It introduces GraphHop, a novel label propagation algorithm that effectively models node attributes and labels jointly, with improved scalability and accuracy.
Findings
Outperforms state-of-the-art methods on various graph classification tasks.
Excels in low-label-rate scenarios and large-scale graphs.
Demonstrates robustness across different types of networks.
Abstract
A scalable semi-supervised node classification method on graph-structured data, called GraphHop, is proposed in this work. The graph contains attributes of all nodes but labels of a few nodes. The classical label propagation (LP) method and the emerging graph convolutional network (GCN) are two popular semi-supervised solutions to this problem. The LP method is not effective in modeling node attributes and labels jointly or facing a slow convergence rate on large-scale graphs. GraphHop is proposed to its shortcoming. With proper initial label vector embeddings, each iteration of GraphHop contains two steps: 1) label aggregation and 2) label update. In Step 1, each node aggregates its neighbors' label vectors obtained in the previous iteration. In Step 2, a new label vector is predicted for each node based on the label of the node itself and the aggregated label information obtained in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Text and Document Classification Technologies · Complex Network Analysis Techniques
