ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Gradient Boosting×Propagação de Rótulos×Random Forest×
ÁreaAprendizado de máquinaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learningMachine learning
Ano de origem200120022001
Autor originalFriedman, J. H.Zhu, X. & Ghahramani, Z.Breiman, L.
TipoEnsemble (sequential boosting of decision trees)Graph-based semi-supervised classificationEnsemble (bagging of decision trees)
Fonte seminalFriedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Outros nomesGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLP, label spreading, graph-based semi-supervised learning, harmonic label propagationRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Relacionados534
ResumoGradient 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.Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 3 Fontes
  3. PUBLISHED
  1. v1
  2. 2 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Gradient Boosting · Label Propagation · Random Forest. Recuperado em 2026-06-18 de https://scholargate.app/pt/compare