विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्व-पर्यवेक्षित बूस्टिंग× | सक्रिय शिक्षण संवर्धन× | |
|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2010s–2020s | 1998 |
| प्रवर्तक≠ | Various researchers (2010s–2020s) | Abe, N. & Mamitsuka, H. |
| प्रकार≠ | Ensemble (self-supervised + boosting) | Hybrid active-learning ensemble |
| मौलिक स्रोत≠ | Yarowsky, D. (1995). Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (pp. 189–196). ACL. link ↗ | Abe, N. & Mamitsuka, H. (1998). Query Learning Strategies Using Boosting and Bagging. Proceedings of the 15th International Conference on Machine Learning (ICML 1998), pp. 1–9. Morgan Kaufmann. link ↗ |
| उपनाम | SSL boosting, self-supervised ensemble boosting, pretext-task boosting, SSL-Boost | boosting-based active learning, query learning with boosting, active boosting, ensemble active learning |
| संबंधित≠ | 6 | 4 |
| सारांश≠ | Self-supervised boosting integrates self-supervised pretext tasks into the boosting framework — covering AdaBoost, gradient boosting, and their modern variants — to leverage large pools of unlabeled data. By first learning feature representations from unlabeled samples and then running sequential weak-learner ensembles on pseudo-labeled data, it achieves competitive accuracy even when ground-truth labels are scarce. | Active Learning Boosting combines the query-driven label acquisition of active learning with the weighted-ensemble logic of boosting algorithms such as AdaBoost. The model iteratively selects the most informative unlabeled examples to annotate — guided by the disagreement or uncertainty within the boosting ensemble — and retrains after each new label, achieving high accuracy with far fewer labeled examples than passive learning. |
| ScholarGateडेटासेट ↗ |
|
|