ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

로버스트 랜덤 포레스트×결정 트리×Isolation Forest×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도2000s–2010s19842008
창시자Various (extensions of Breiman 2001 Random Forest)Breiman, Friedman, Olshen & StoneLiu, F.T., Ting, K.M. & Zhou, Z.-H.
유형Robust Ensemble (noise-tolerant bagging of decision trees)Recursive partitioning (if-then rules)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 ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗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 forestKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
관련655
요약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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Robust Random Forest · Decision Tree · Isolation Forest. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare