ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

バギング(ブートストラップ集約)×アイソレーションフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年19962008
提唱者Breiman, L.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
種類Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Unsupervised ensemble (random partitioning trees)
原典Breiman, 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 ↗
別名Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
関連55
概要Bagging, 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.
ScholarGateデータセット
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Bagging · Isolation Forest. 2026-06-17に以下より取得 https://scholargate.app/ja/compare