Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Байесовское дерево решений× | Гауссовский процесс× | |
|---|---|---|
| Область | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1998 | 2006 (book); roots in Kriging, 1951) |
| Автор метода≠ | Chipman, H. A.; George, E. I.; McCulloch, R. E. | Rasmussen, C. E. & Williams, C. K. I. |
| Тип≠ | Bayesian ensemble / tree model | Probabilistic non-parametric model |
| Основополагающий источник≠ | Chipman, H. A., George, E. I., & McCulloch, R. E. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935–948. DOI ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Другие названия | Bayesian CART, BCART, Bayesian tree induction, probabilistic decision tree | GP, Gaussian Process Regression, GPR, Kriging |
| Связанные≠ | 5 | 3 |
| Сводка≠ | Bayesian Decision Tree (Bayesian CART) places a prior distribution over tree structures and leaf parameters, then uses Markov chain Monte Carlo to explore the posterior distribution of trees given data. Instead of a single best tree, it produces a distribution of plausible trees whose predictions are averaged, yielding calibrated uncertainty estimates alongside point predictions. | 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Набор данных ↗ |
|
|