A Consistent Diffusion-Based Algorithm for Semi-Supervised Graph Learning
Not on the map. Why?
Abstract (arXiv)
The task of semi-supervised classification aims at assigning labels to all nodes of a graph based on the labels known for a few nodes, called the seeds. One of the most popular algorithms relies on the principle of heat diffusion, where the labels of the seeds are spread by thermoconductance and the temperature of each node at equilibrium is used as a score function for each label. In this paper, we prove that this algorithm is not consistent unless the temperatures of the nodes at equilibrium are centered before scoring. This crucial step does not only make the algorithm provably consistent on a block model but brings significant performance gains on real graphs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 14 references that are in the map. First posted on arXiv 13 Nov 2023.
Builds on
5 of 14 references.
References · 5
- 2017Cooperative Game Theory Approaches for Network Partitioningcited by 134
- 2017Learning Structural Node Embeddings Via Diffusion Waveletscited by 97
- 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 62
- 2016Learning heat diffusion graphscited by 39
- 2019Semi-supervised Learning on Graph with an Alternating Diffusion Processcited by 1
Built on by
Not cited yet.