ScholarGate
어시스턴트

방법 비교

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

적층×XGBoost×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도19922016
창시자Wolpert, D.H.Chen, T. & Guestrin, C.
유형Ensemble (heterogeneous meta-learning)Ensemble (gradient-boosted decision trees)
원전Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
별칭Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learnerXGBoost, extreme gradient boosting, scalable tree boosting
관련55
요약Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

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

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