So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Isolation Forest× | Cây Quyết định× | Mô hình Hỗn hợp Gaussian× | |
|---|---|---|---|
| Lĩnh vực | Học máy | Học máy | Học máy |
| Họ | Machine learning | Machine learning | Machine learning |
| Năm ra đời≠ | 2008 | 1984 | 1977 |
| Người khởi xướng≠ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. | Breiman, Friedman, Olshen & Stone | Dempster, Laird & Rubin (EM algorithm) |
| Loại≠ | Unsupervised ensemble (random partitioning trees) | Recursive partitioning (if-then rules) | Probabilistic (soft) clustering — mixture model |
| Công trình gốc≠ | 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 ↗ | Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22. DOI ↗ |
| Tên gọi khác≠ | Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians |
| Liên quan≠ | 5 | 5 | 4 |
| Tóm tắt≠ | 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. | A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation. |
| ScholarGateBộ dữ liệu ↗ |
|
|
|