Fractional Heat Kernel for Semi-Supervised Graph Learning with Small Training Sample Size
In this work, we introduce novel algorithms for label propagation and self-training using fractional heat kernel dynamics with a source term. We motivate the methodology through the classical correspondence of information theory with the physics of parabolic evolution equations. We integrate the fractional heat kernel into Graph Neural Network architectures such as Graph Convolutional Networks and Graph Attention, enhancing their expressiveness through adaptive, multi-hop diffusion. By applying Chebyshev polynomial approximations, large graphs become computationally feasible. Motivating variational formulations demonstrate that by extending the classical diffusion model to fractional powers of the Laplacian, nonlocal interactions deliver more globally diffusing labels. The particular balance between supervision of known labels and diffusion across the graph is particularly advantageous in the case where only a small number of labeled training examples are present. We demonstrate the effectiveness of this approach on standard datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Neural NetworkGraph LearningSimilar Papers 제목 키워드 기반
Graph Convolutional Networks using Heat Kernel for Semi-supervised Learning
Graph convolutional networks gain remarkable success in semi-supervised learning on graph structured data. The key to graph-based semisupervised learning is capturing the smoothness of labels or features over nodes exert…
Fractional Graph Convolutional Networks (FGCN) for Semi-Supervised Learning
Due to high utility in many applications, from social networks to blockchain to power grids, deep learning on non-Euclidean objects such as graphs and manifolds continues to gain an ever increasing interest. Most current…
Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
We study the problem of semi-supervised learning on graphs in the regime where data labels are scarce or possibly corrupted. We propose an approach called $p$-conductance learning that generalizes the $p$-Laplace and Poi…
Semi-Supervised Learning on Graphs with Feature-Augmented Graph Basis Functions
For semi-supervised learning on graphs, we study how initial kernels in a supervised learning regime can be augmented with additional information from known priors or from unsupervised learning outputs. These augmented k…
Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification
We present a deep Graph Convolutional Kernel Machine (GCKM) for semi-supervised node classification in graphs. The method is built of two main types of blocks: (i) We introduce unsupervised kernel machine layers propagat…
ClassificationNode Classification