Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Active Learning Voting Ensemble× | Bagging (Bootstrap Aggregating)× | |
|---|---|---|
| Fagområde | Maskinlæring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Oprindelsesår≠ | 1992 | 1996 |
| Ophavsperson≠ | Seung, H. S., Opper, M., & Sompolinsky, H. | Breiman, L. |
| Type≠ | Active learning with ensemble voting | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| Oprindelig kilde≠ | Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT '92), pp. 287–294. ACM. DOI ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| Aliasser≠ | Query by Committee, QBC, active ensemble learning, committee-based active learning | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| Relaterede | 5 | 5 |
| Resumé≠ | Active Learning Voting Ensemble — formally known as Query by Committee — is an active learning strategy that trains a committee of diverse models and selects the unlabeled examples where the committee members disagree most for human annotation. By focusing labeling effort on the most informative points, it achieves high accuracy with far fewer labeled examples than passive 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. |
| ScholarGateDatasæt ↗ |
|
|