Semi-supervised learning based on high density region estimation
From MaRDI portal
Publication:1784700
DOI10.1016/j.neunet.2010.06.001zbMath1396.68089OpenAlexW2007515567WikidataQ46895333 ScholiaQ46895333MaRDI QIDQ1784700
Luoqing Li, Jiangtao Peng, Hong Chen
Publication date: 27 September 2018
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2010.06.001
Related Items
The convergence rate of semi-supervised regression with quadratic loss ⋮ Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Convergence rate of the semi-supervised greedy algorithm ⋮ Convergence rate of SVM for kernel-based robust regression
Cites Work
- Learning and approximation by Gaussians on Riemannian manifolds
- A plug-in approach to support estimation
- The covering number in learning theory
- New approaches to statistical learning theory
- The generalization performance of ERM algorithm with strongly mixing observations
- Error bounds of multi-graph regularized semi-supervised classification
- Approximation methods for supervised learning
- The performance bounds of learning machines based on exponentially strongly mixing sequences
- Concentration inequalities and asymptotic results for ratio type empirical processes
- On the mathematical foundations of learning
- Learning Theory
- Capacity of reproducing kernel spaces in learning theory
- Input-dependent estimation of generalization error under covariate shift
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- Learning Theory
- Trading Variance Reduction with Unbiasedness: The Regularized Subspace Information Criterion for Robust Model Selection in Kernel Regression
- Classification with reject option
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
