ScholarGate
সহকারী

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

নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।

গ্রেডিয়েন্ট বুস্টিং×লেবেল প্রোপাগেশন×আধা-তত্ত্বাবধানাধীন শিখন (Semi-supervised Learning)×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখন
পরিবারMachine learningMachine learningMachine learning
উদ্ভবের বছর200120021970s–2006 (formalized)
প্রবর্তকFriedman, J. H.Zhu, X. & Ghahramani, Z.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
ধরনEnsemble (sequential boosting of decision trees)Graph-based semi-supervised classificationLearning paradigm
মৌলিক উৎসFriedman, 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 ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
অপর নামGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLP, label spreading, graph-based semi-supervised learning, harmonic label propagationSSL, semi-supervised machine learning, transductive learning, label-efficient learning
সম্পর্কিত535
সারসংক্ষেপ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.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.Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.
ScholarGateডেটাসেট
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 3 উৎস
  3. PUBLISHED
  1. v1
  2. 2 উৎস
  3. PUBLISHED

অনুসন্ধানে যান স্লাইড ডাউনলোড করুন

ScholarGateপদ্ধতির তুলনা করুন: Gradient Boosting · Label Propagation · Semi-supervised Learning. 2026-06-18 তারিখে সংগৃহীত, উৎস: https://scholargate.app/bn/compare