পদ্ধতির তুলনা করুন

	লেবেল প্রোপাগেশন	Random Forest	XGBoost
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning	Machine learning
উদ্ভবের বছর	2002	2001	2016
প্রবর্তক	Zhu, X. & Ghahramani, Z.	Breiman, L.	Chen, T. & Guestrin, C.
ধরন	Graph-based semi-supervised classification	Ensemble (bagging of decision trees)	Ensemble (gradient-boosted decision trees)
মৌলিক উৎস	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
অপর নাম	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
সম্পর্কিত	3	4	5
সারসংক্ষেপ	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.	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.