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.

Học chủ động×Rừng ngẫu nhiên×XGBoost×
Lĩnh vựcHọc máyHọc máyHọc máy
HọMachine learningMachine learningMachine learning
Năm ra đời200920012016
Người khởi xướngBurr SettlesBreiman, L.Chen, T. & Guestrin, C.
LoạiInteractive supervised learning frameworkEnsemble (bagging of decision trees)Ensemble (gradient-boosted decision trees)
Công trình gốcSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
Tên gọi khácQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleXGBoost, extreme gradient boosting, scalable tree boosting
Liên quan245
Tóm tắtActive learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.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.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.
ScholarGateBộ dữ liệu
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 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: Active Learning · Random Forest · XGBoost. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare