返回
Maximum density minimum redundancy based hypergraph regularized support vector regression
DOI:10.1007/s13042-022-01738-w.png)
摘要
En 中文
Semi-supervised learning has attracted great attention in machine learning for it makes full use of labeled and unlabeled data for training. Most semi-supervised learning methods are not suitable for regression due to the data labels in regression are real-valued and smooth. In this paper, hypergraph instead of graph is utilized to represent the geometric structure of data. The manifold regularization term is constructed by calculating the hypergraph Laplacian and introduced into the regularization framework of kernel learning, a hypergraph regularized support vector regression (HGSVR) is proposed. Moreover, we propose a two-layer maximum density minimum redundancy method (MDMR) to pre-select initial labeled data, which fully considers the density and redundancy of data. The pre-select method is introduced into HGSVR and a second semi-supervised regression called MDMR-HGSVR is proposed. Experimental results on 9 UCI datasets show that HGSVR and MDMR-HGSVR outperform the other compared semi-supervised regression methods.
Keyword:
Semi-supervised learning
Hypergraph
Support vector regression
Maximum density minimum redundancy
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
暂无机构信息
引用论文
Label propagation via local geometry preserving for deep semi-supervised image recognition
NEURAL NETWORKS
IF6.3
Broad learning system with manifold regularized sparse features for semi-supervised classification用于半监督分类的具有流形正则化稀疏特征的广义学习系统
NEUROCOMPUTING
IF6.5

