השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| למידה סמי-מפוקחת עם רגולריזציה× | תהליך גאוסי× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2006 | 2006 (book); roots in Kriging, 1951) |
| הוגה השיטה≠ | Belkin, M.; Niyogi, P.; Sindhwani, V. | Rasmussen, C. E. & Williams, C. K. I. |
| סוג≠ | Regularized learning paradigm | Probabilistic non-parametric model |
| מקור מכונן≠ | 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 ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| כינויים | manifold regularization, graph-regularized SSL, semi-supervised regularization, Laplacian regularization | GP, Gaussian Process Regression, GPR, Kriging |
| קשורות≠ | 6 | 3 |
| תקציר≠ | 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. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|