เปรียบเทียบวิธี

	Active Learning	Boosting	การเรียนรู้แบบกึ่งกำกับดูแล
สาขาวิชา	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning	Machine learning
ปีกำเนิด	2009	1990–1997	1970s–2006 (formalized)
ผู้ริเริ่ม	Burr Settles	Schapire, R. E.; Freund, Y.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
ประเภท	Interactive supervised learning framework	Sequential ensemble (iterative reweighting)	Learning paradigm
แหล่งต้นตำรับ	Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648.	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.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
ชื่อเรียกอื่น	Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
ที่เกี่ยวข้อง	2	6	5
สรุป	Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.