.png){kind=icon}
Return
Maximum density minimum redundancy based hypergraph regularized support vector regression
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-022-01738-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Semi-supervised learning
Hypergraph
Support vector regression
Maximum density minimum redundancy
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
No organization information available
Cited Papers
Survival of the postharvest biocontrol yeastCandida sakeCPA-1 after dehydration by spray-drying
PREAI
ShareSave
ShareSaveLabel propagation via local geometry preserving for deep semi-supervised image recognition.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSaveBroad learning system with manifold regularized sparse features for semi-supervised classificationNEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSave
View more