返回
Semi-supervised learning with graph convolutional extreme learning machines
DOI:10.1016/j.eswa.2022.119164.png)
摘要
En 中文
Extreme Learning Machine (ELM) has been widely used for various classification problems. However, the traditional ELMs are typically based on the regular Euclidean data, thus ignoring the intrinsic structured information among data and resulting in poor robustness. In this paper, we present a novel semi-supervised learning framework, termed Graph Convolutional Extreme Learning Machines (GCELM), based on extending the traditional ELM to the non-Euclidean domain. Technically, we recast ELM layers into a randomized graph convolutional embedding layer followed by a graph convolutional regression layer, which endows ELM with the capability to handle graphs in the non-Euclidean domain. Benefiting from the diversity of the randomized graph convolution, we further propose an enhanced GCELM, i.e., Voting-based GCELM (V-GCELM), by using a simple voting ensemble strategy. The proposed methods preserve the advantages of ELMs, thus being more efficient than the gradient-based graph convolutional networks but without loss of graph learning ability. Extensive experiments on 36 benchmark datasets demonstrate that the proposed methods significantly outperform many previous semi-supervised classification methods.
Keyword:
Extreme learning machine
Graph convolutional network
Semi-supervised classification
Ensemble learning
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Productivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materials
Desalination
IF0
KCRec: Knowledge-aware representation Graph Convolutional Network for RecommendationKCRec: 用于推荐的知识感知表示图卷积网络
Graph Convolutional Subspace Clustering: A Robust Subspace Clustering Framework for Hyperspectral Image图卷积子空间聚类: 高光谱图像鲁棒子空间聚类框架

