ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Apprentissage semi-supervisé bayésien×Processus Gaussien×
DomaineApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine2003–20062006 (book); roots in Kriging, 1951)
Auteur d'origineChapelle, Scholkopf & Zien; Zhu, Ghahramani & LaffertyRasmussen, C. E. & Williams, C. K. I.
TypeProbabilistic semi-supervised frameworkProbabilistic non-parametric model
Source fondatriceChapelle, O., Scholkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9
AliasBayesian SSL, probabilistic semi-supervised learning, generative semi-supervised model, Bayesian transductive learningGP, Gaussian Process Regression, GPR, Kriging
Apparentées63
RésuméBayesian semi-supervised learning is a probabilistic framework that uses both a small labeled dataset and a larger pool of unlabeled observations to infer model parameters and make predictions. By treating missing labels as latent variables and placing priors over parameters, it naturally quantifies uncertainty while leveraging unlabeled data to improve generalization.A Gaussian Process (GP) is a non-parametric, fully probabilistic machine learning model that places a prior distribution directly over functions. Rather than predicting a single value, it returns a predictive mean and a calibrated uncertainty estimate at every test point, making it especially valuable for regression on small to medium datasets and for Bayesian optimization tasks.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Bayesian Semi-supervised Learning · Gaussian Process. Consulté le 2026-06-15 sur https://scholargate.app/fr/compare