Σύγκριση μεθόδων

	Μπεϋζιανό XGBoost	LightGBM	Τυχαίο Δάσος
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning	Machine learning
Έτος προέλευσης	2012–2016	2017	2001
Δημιουργός	Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)	Ke, G. et al. (Microsoft)	Breiman, L.
Τύπος	Ensemble (gradient boosted trees with Bayesian hyperparameter search)	Gradient boosting decision tree ensemble	Ensemble (bagging of decision trees)
Θεμελιώδης πηγή	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794.	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. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Εναλλακτικές ονομασίες	Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost	LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Συναφείς	4	5	4
Σύνοψη	Bayesian XGBoost combines the predictive power of Extreme Gradient Boosting with Bayesian optimization for hyperparameter tuning. Instead of grid or random search, a probabilistic surrogate model guides the search for optimal learning rate, tree depth, and regularization parameters, achieving near-peak performance with far fewer evaluations than exhaustive search approaches.	LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.	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.