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

	Δέντρο Αποφάσεων	Τυχαίο Δάσος	XGBoost
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning	Machine learning
Έτος προέλευσης	1984	2001	2016
Δημιουργός	Breiman, Friedman, Olshen & Stone	Breiman, L.	Chen, T. & Guestrin, C.
Τύπος	Recursive partitioning (if-then rules)	Ensemble (bagging of decision trees)	Ensemble (gradient-boosted decision trees)
Θεμελιώδης πηγή	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
Εναλλακτικές ονομασίες	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
Συναφείς	5	4	5
Σύνοψη	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.