Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification
Not on the map. Why?
Abstract (arXiv)
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 propagating the node features in a one-hop neighborhood, using implicit node feature mappings. (ii) We specify a semi-supervised classification kernel machine through the lens of the Fenchel-Young inequality. We derive an effective initialization scheme and efficient end-to-end training algorithm in the dual variables for the full architecture. The main idea underlying GCKM is that, because of the unsupervised core, the final model can achieve higher performance in semi-supervised node classification when few labels are available for training. Experimental results demonstrate the effectiveness of the proposed framework.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 23 of its 49 references that are in the map. First posted on arXiv 31 Jan 2023.
Builds on
23 of 49 references.
References · 23
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2021Convex optimizationcited by 2,515
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2018To understand deep learning we need to understand kernel learningcited by 187
11 more
- 2019Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernelscited by 161
- 2019A Survey on Graph Kernelscited by 148
- 2019Wasserstein Weisfeiler-Lehman Graph Kernelscited by 104
- 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 80
- 2022KerGNNs: Interpretable Graph Neural Networks with Graph Kernelscited by 50
- 2020Convolutional Kernel Networks for Graph-Structured Datacited by 38
- 2017Deriving Neural Architectures from Sequence and Graph Kernelscited by 23
- 2020Disentangled Representation Learning and Generation with Manifold Optimizationcited by 15
- 2020Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraintscited by 9
- 2017Kernel Graph Convolutional Neural Networkscited by 7
- 2022Tensor-based Multi-view Spectral Clustering via Shared Latent Spacecited by 5
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.