ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Arbre de décision×Gradient Boosting×Isolation Forest×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learningMachine learning
Année d'origine198420012008
Auteur d'origineBreiman, Friedman, Olshen & StoneFriedman, J. H.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
TypeRecursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)Unsupervised ensemble (random partitioning trees)
Source fondatriceBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
AliasKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Apparentées555
Résumé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.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.Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Decision Tree · Gradient Boosting · Isolation Forest. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare