ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

CatBoost×AdaBoost×Rừng ngẫu nhiên×
Lĩnh vựcHọc máyHọc máyHọc máy
HọMachine learningMachine learningMachine learning
Năm ra đời201819972001
Người khởi xướngProkhorenkova, L. et al. (Yandex)Freund, Y. & Schapire, R.E.Breiman, L.
LoạiGradient boosting on decision treesEnsemble (sequential boosting of weak learners)Ensemble (bagging of decision trees)
Công trình gốcProkhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗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. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Tên gọi khácCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Liên quan554
Tóm tắtCatBoost is a gradient boosting algorithm, introduced by Prokhorenkova and colleagues at Yandex in 2018, that handles categorical variables natively and uses ordered target encoding to avoid label leakage. By building an additive ensemble of trees while permuting the data order at each iteration, it is often superior to XGBoost and LightGBM on category-heavy data.AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateBộ dữ liệu
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: CatBoost · AdaBoost · Random Forest. Truy cập ngày 2026-06-19 từ https://scholargate.app/vi/compare