ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

적층 일반화×부스팅 앙상블×
분야앙상블 학습앙상블 학습
계열Machine learningMachine learning
기원 연도19921990
창시자David WolpertRobert Schapire
유형meta-learning aggregationsequential ensemble
원전Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227. DOI ↗
별칭stacking, meta-learningadaptive boosting, sequential ensemble
관련34
요약Stacked generalization, or stacking, is a two-level ensemble method where base-level classifiers are trained on the original data, and a meta-learner is trained on the predictions of the base classifiers. The meta-learner learns how to best combine base predictions rather than using fixed aggregation rules. Introduced by David Wolpert in 1992, stacking achieves state-of-the-art performance by automatically learning the optimal weighting and interaction patterns among base models.Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Stacked Generalization · Boosting Ensemble. 2026-06-15에 다음에서 검색함: https://scholargate.app/ko/compare