Machine learningMachine learning

Regularized Semi-Supervised Learning

Regularized semi-supervised learning adds explicit geometric or graph-based penalty terms to a semi-supervised objective so that the decision function varies smoothly over the data manifold. Pioneered through manifold regularization (Belkin, Niyogi & Sindhwani, 2006), it exploits the structure of both labeled and unlabeled examples to learn more accurate models than supervised regularization alone when labeled data are scarce.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Belkin, M., Niyogi, P., & Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399–2434. link
  2. Chapelle, O., Scholkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9

Related methods

ScholarGateRegularized semi-supervised learning (Regularized Semi-Supervised Learning (Manifold Regularization and Graph-Based SSL)). Retrieved 2026-06-04 from https://scholargate.app/tr/machine-learning/regularized-semi-supervised-learning