ScholarGate
Βοηθός

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

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

AdaBoost×Δέντρο Αποφάσεων×LightGBM×
ΠεδίοΜηχανική ΜάθησηΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learningMachine learning
Έτος προέλευσης199719842017
ΔημιουργόςFreund, Y. & Schapire, R.E.Breiman, Friedman, Olshen & StoneKe, G. et al. (Microsoft)
ΤύποςEnsemble (sequential boosting of weak learners)Recursive partitioning (if-then rules)Gradient boosting decision tree ensemble
Θεμελιώδης πηγήFreund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗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. link ↗
Εναλλακτικές ονομασίεςAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
Συναφείς555
ΣύνοψηAdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.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.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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: AdaBoost · Decision Tree · LightGBM. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare