ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Bagging (Bootstrap Aggregating)×Isolation Forest×
BidangPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learning
Tahun asal19962008
PengasasBreiman, L.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
JenisEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Unsupervised ensemble (random partitioning trees)
Sumber perintisBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
AliasBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Berkaitan55
RingkasanBagging, 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.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.
ScholarGateSet data
  1. v1
  2. 3 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Bagging · Isolation Forest. Dicapai 2026-06-17 daripada https://scholargate.app/ms/compare