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.

Bagging (Bootstrap Aggregating)×Gradient Boosting×Isolation Forest×
Lĩnh vựcHọc máyHọc máyHọc máy
HọMachine learningMachine learningMachine learning
Năm ra đời199620012008
Người khởi xướngBreiman, L.Friedman, J. H.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
LoạiEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Ensemble (sequential boosting of decision trees)Unsupervised ensemble (random partitioning trees)
Công trình gốcBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
Tên gọi khácBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Liên quan555
Tóm tắtBagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets.
ScholarGateBộ dữ liệu
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 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: Bagging · Gradient Boosting · Isolation Forest. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare