ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

Propagación de Etiquetas×Random Forest×XGBoost×
CampoAprendizaje automáticoAprendizaje automáticoAprendizaje automático
FamiliaMachine learningMachine learningMachine learning
Año de origen200220012016
Autor originalZhu, X. & Ghahramani, Z.Breiman, L.Chen, T. & Guestrin, C.
TipoGraph-based semi-supervised classificationEnsemble (bagging of decision trees)Ensemble (gradient-boosted decision trees)
Fuente seminalZhu, 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 ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
AliasLP, label spreading, graph-based semi-supervised learning, harmonic label propagationRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleXGBoost, extreme gradient boosting, scalable tree boosting
Relacionados345
ResumenLabel 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.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.
ScholarGateConjunto de datos
  1. v1
  2. 3 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 1 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Label Propagation · Random Forest · XGBoost. Recuperado el 2026-06-19 de https://scholargate.app/es/compare