পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| অ্যাডাবুস্ট× | আধা-তত্ত্বাবধানাধীন শিখন (Semi-supervised Learning)× | |
|---|---|---|
| ক্ষেত্র | যন্ত্র শিখন | যন্ত্র শিখন |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1997 | 1970s–2006 (formalized) |
| প্রবর্তক≠ | Freund, Y. & Schapire, R.E. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| ধরন≠ | Ensemble (sequential boosting of weak learners) | Learning paradigm |
| মৌলিক উৎস≠ | Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| অপর নাম≠ | AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| সম্পর্কিত | 5 | 5 |
| সারসংক্ষেপ≠ | AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification. | 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ডেটাসেট ↗ |
|
|