So sánh phương pháp

	Tập hợp bỏ phiếu mạnh mẽ	Boosting
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	2000s–2010s	1990–1997
Người khởi xướng	Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML community	Schapire, R. E.; Freund, Y.
Loại	Robust ensemble aggregation	Sequential ensemble (iterative reweighting)
Công trình gốc	Dietterich, T. G. (2000). Ensemble methods in machine learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems, LNCS 1857, 1–15. Springer.	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.
Tên gọi khác	robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combination	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Liên quan	6	6
Tóm tắt	Robust Voting Ensemble combines predictions from multiple base classifiers using noise-tolerant aggregation — such as weighted voting, trimmed voting, or median-based combination — to produce final decisions that remain reliable when individual classifiers are corrupted by noisy labels, adversarial inputs, or distributional shift.	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.