Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ενεργή Μάθηση× | Bagging (Bootstrap Aggregating)× | |
|---|---|---|
| Πεδίο | Μηχανική Μάθηση | Μηχανική Μάθηση |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 2009 | 1996 |
| Δημιουργός≠ | Burr Settles | Breiman, L. |
| Τύπος≠ | Interactive supervised learning framework | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| Θεμελιώδης πηγή≠ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| Εναλλακτικές ονομασίες≠ | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| Συναφείς≠ | 2 | 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. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|