ScholarGate
アシスタント

手法を比較

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

ロバスト・ランダム・フォレスト×アイソレーションフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年2000s–2010s2008
提唱者Various (extensions of Breiman 2001 Random Forest)Liu, F.T., Ting, K.M. & Zhou, Z.-H.
種類Robust Ensemble (noise-tolerant bagging of decision trees)Unsupervised ensemble (random partitioning trees)
原典Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18. link ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
別名RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forestIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
関連65
概要Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect.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. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

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

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