返回
Hessian unsupervised extreme learning machine
DOI:10.1007/s13042-023-02012-3.png)
摘要
En 中文
Extreme learning machines (ELMs) are shown to be efficient and effective learning algorithms for regression and classification tasks. ELMs, however, are typically utilized to solve supervised learning problems. Only a handful of research on ELMs focuses on exploring unlabeled data. One representative work is the unsupervised extreme learning machine (US-ELM), where the standard ELM is expanded for unsupervised learning based on Laplacian regularization. However, Laplacian regularization has poor extrapolation power since it tends to bias the solution towards a constant function. In this paper, we propose a new framework termed Hessian unsupervised ELM (HUS-ELM) to enhance the unsupervised learning of ELM. In particular, Hessian regularization can properly exploit the intrinsic local geometry of the data manifold compared to Laplacian regularization. This leverages the performance of HUS-ELM in unsupervised learning problems since the Hessian regularization can correctly reflect the positional relationship between the unlabeled samples. Six publicly available datasets are used to evaluate the proposed algorithm. The experimental results indicate that the proposed method performs better than other unsupervised learning methods in terms of clustering accuracy.
Keyword:
Extreme learning machine
graph Laplacian
graph Hessian
Unsupervised learning
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Productivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materials
Desalination
IF0
Active Learning From Imbalanced Data: A Solution of Online Weighted Extreme Learning Machine不平衡数据的主动学习: 在线加权极限学习机的解决方案
Incremental laplacian regularization extreme learning machine for online learning用于在线学习的增量拉普拉斯正则化极限学习机
Unsupervised feature selection based extreme learning machine for clustering基于无监督特征选择的极限学习机聚类
NEUROCOMPUTING
IF6.5

