方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 正则化半监督学习× | 高斯过程× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | 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数据集 ↗ |
|
|