ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Vysvětlitelný rozhodovací strom×Rozhodovací strom×XGBoost×
OborStrojové učeníStrojové učeníStrojové učení
RodinaMachine learningMachine learningMachine learning
Rok vzniku1984 (CART); XAI framing formalized 2010s–2020s19842016
TvůrceBreiman, L.; Friedman, J.; Olshen, R. A.; Stone, C. J.Breiman, Friedman, Olshen & StoneChen, T. & Guestrin, C.
TypInterpretable supervised learning modelRecursive partitioning (if-then rules)Ensemble (gradient-boosted decision trees)
Původní zdrojBreiman, L., Friedman, J., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole. ISBN: 978-0-412-04841-8Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
Další názvyXDT, interpretable decision tree, rule-based decision tree, transparent decision treeKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeXGBoost, extreme gradient boosting, scalable tree boosting
Příbuzné455
ShrnutíAn Explainable Decision Tree is a classification or regression tree deliberately grown to be shallow, readable, and auditable — producing a finite set of if-then rules that a human can verify without additional tools. It sits at the intersection of predictive modelling and Explainable AI (XAI), chosen when stakeholders must understand and trust every prediction the model makes.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.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Explainable Decision Tree · Decision Tree · XGBoost. Získáno 2026-06-18 z https://scholargate.app/cs/compare