GraphHop: An Enhanced Label Propagation Method for Node Classification
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 Step 1. This iterative procedure exploits the neighborhood information and enables GraphHop to perform well in an extremely small label rate setting and scale well for very large graphs. Experimental results show that GraphHop outperforms state-of-the-art graph learning methods on a wide range of tasks (e.g., multi-label and multi-class classification on citation networks, social graphs, and commodity consumption graphs) in graphs of various sizes. Our codes are publicly available on GitHub (https://github.com/TianXieUSC/GraphHop).
Code (1)
Tasks
ClassificationGeneral ClassificationGraph LearningMulti-class ClassificationNode ClassificationSimilar Papers 제목 키워드 기반
Label Efficient Regularization and Propagation for Graph Node Classification
An enhanced label propagation (LP) method called GraphHop was proposed recently. It outperforms graph convolutional networks (GCNs) in the semi-supervised node classification task on various networks. Although the perfor…
AttributeBenchmarkingClassificationComputational Efficiency+2Convolutional Networks on Enhanced Message-Passing Graph Improve Semi-Supervised Classification with Few Labels
Efficient message propagation is critical to node classification in sparse graph with few labels that remains largely unaddressed until now. Recently popularized Graph Convolutional Networks (GCNs) lack the ability to pr…
Graph EmbeddingNode ClassificationEvidential Label Propagation Algorithm for Graphs
Community detection has attracted considerable attention crossing many areas as it can be used for discovering the structure and features of complex networks. With the increasing size of social networks in real world, co…
Community DetectionVirtual Node Generation for Node Classification in Sparsely-Labeled Graphs
In the broader machine learning literature, data-generation methods demonstrate promising results by generating additional informative training examples via augmenting sparse labels. Such methods are less studied in grap…
Graph LearningMeta-LearningNode ClassificationSelf-Supervised LearningTopics and Label Propagation: Best of Both Worlds for Weakly Supervised Text Classification
We propose a Label Propagation based algorithm for weakly supervised text classification. We construct a graph where each document is represented by a node and edge weights represent similarities among the documents. Add…
General Classificationtext-classificationText Classification