手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| アイソレーションフォレスト× | 決定木× | 主成分分析× | ランダムフォレスト× | |
|---|---|---|---|---|
| 分野 | 機械学習 | 機械学習 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning | Machine learning | Machine learning |
| 提唱年≠ | 2008 | 1984 | 2002 | 2001 |
| 提唱者≠ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. | Breiman, Friedman, Olshen & Stone | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) | Breiman, L. |
| 種類≠ | Unsupervised ensemble (random partitioning trees) | Recursive partitioning (if-then rules) | Unsupervised dimensionality reduction | Ensemble (bagging of decision trees) |
| 原典≠ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 別名≠ | Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 関連≠ | 5 | 5 | 3 | 4 |
| 概要≠ | 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. | 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. | Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateデータセット ↗ |
|
|
|
|