Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Bayesian LightGBM× | Gradient Boosting× | Juhuslik mets× | |
|---|---|---|---|
| Valdkond | Masinõpe | Masinõpe | Masinõpe |
| Perekond | Machine learning | Machine learning | Machine learning |
| Tekkeaasta≠ | 2017 (LightGBM); 2012 (Bayesian optimization) | 2001 | 2001 |
| Looja≠ | Ke et al. (LightGBM); Snoek et al. (Bayesian optimization) | Friedman, J. H. | Breiman, L. |
| Tüüp≠ | Gradient boosting with Bayesian hyperparameter search | Ensemble (sequential boosting of decision trees) | Ensemble (bagging of decision trees) |
| Algallikas≠ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems, 30, 3146–3154. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Rööpnimetused | Bayesian-tuned LightGBM, LightGBM + Bayesian optimization, BayesOpt LightGBM, LightGBM with BayesOpt | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Seotud≠ | 5 | 5 | 4 |
| Kokkuvõte≠ | Bayesian LightGBM combines LightGBM — a highly efficient histogram-based gradient boosting framework — with Bayesian hyperparameter optimization. Instead of exhaustive grid search or random search, a probabilistic surrogate model guides the search for optimal hyperparameters, dramatically reducing the number of costly model evaluations needed to reach strong predictive performance. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateAndmestik ↗ |
|
|
|