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.
| Phân cụm phân cấp× | Phân tích Phân biệt Tuyến tính (LDA× | Rừng ngẫu nhiên× | |
|---|---|---|---|
| Lĩnh vực≠ | Học máy | Thống kê | Học máy |
| Họ≠ | Machine learning | Hypothesis test | Machine learning |
| Năm ra đời≠ | 1963 | 1936 | 2001 |
| Người khởi xướng≠ | Ward, J. H. | Ronald A. Fisher | Breiman, L. |
| Loại≠ | Unsupervised clustering (agglomerative) | Parametric linear classifier / dimensionality reduction | Ensemble (bagging of decision trees) |
| Công trình gốc≠ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ | Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Tên gọi khác≠ | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering | LDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysis | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Liên quan≠ | 4 | 7 | 4 |
| Tóm tắt≠ | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. | Linear Discriminant Analysis (LDA) is a parametric supervised classification method that finds the linear combination of continuous predictors that best separates two or more predefined groups. Introduced by Ronald A. Fisher in his landmark 1936 paper on taxonomic measurements, it simultaneously serves as a classifier and a dimensionality-reduction tool, and can be understood as the classification-oriented counterpart of MANOVA. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|
|