Semi-supervised learning based on high density region estimation

DOI10.1016/J.NEUNET.2010.06.001MaRDI QIDQ1784700zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hong Chen, Luoqing Li, Jiangtao Peng

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

zbMATH Keywords

density estimationerror analysislocal risk minimizationsemi-supervised learninglearning rate

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Semi-supervised learning with density-ratio estimation
• Semi-supervised learning with regularized Laplacian
• High-dimensional semi-supervised learning: in search of optimal inference of the mean
• Density-sensitive semisupervised inference
• On semi-supervised learning
• Improved estimators for semi-supervised high-dimensional regression model
• An efficient spatial semi-supervised learning algorithm

Cites work

• scientific article; zbMATH DE number 5957483 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• A plug-in approach to support estimation
• Approximation methods for supervised learning
• Capacity of reproducing kernel spaces in learning theory
• Classification with reject option
• Concentration inequalities and asymptotic results for ratio type empirical processes
• Error bounds of multi-graph regularized semi-supervised classification
• Generalization error bounds in semi-supervised classification under the cluster assumption
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• Input-dependent estimation of generalization error under covariate shift
• Learning Theory
• Learning Theory
• Learning and approximation by Gaussians on Riemannian manifolds
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• New approaches to statistical learning theory
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• On the mathematical foundations of learning
• The covering number in learning theory
• The generalization performance of ERM algorithm with strongly mixing observations
• The performance bounds of learning machines based on exponentially strongly mixing sequences
• Trading Variance Reduction with Unbiasedness: The Regularized Subspace Information Criterion for Robust Model Selection in Kernel Regression

Cited in

(9)

• The performance of semi-supervised Laplacian regularized regression with the least square loss
• Semi-supervised learning with density-ratio estimation
• Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition
• Convergence rate of SVM for kernel-based robust regression
• Minimum density hyperplanes
• Density-sensitive semisupervised inference
• The convergence rate of semi-supervised regression with quadratic loss
• A unified view of density-based methods for semi-supervised clustering and classification
• Convergence rate of the semi-supervised greedy algorithm

This page was built for publication: Semi-supervised learning based on high density region estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784700)