方法对比

	层次聚类	线性判别分析 (LDA	随机森林
领域	机器学习	统计学	机器学习
方法族	Machine learning	Hypothesis test	Machine learning
起源年份	1963	1936	2001
提出者	Ward, J. H.	Ronald A. Fisher	Breiman, L.
类型	Unsupervised clustering (agglomerative)	Parametric linear classifier / dimensionality reduction	Ensemble (bagging of decision trees)
开创性文献	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	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
相关	4	7	4
摘要	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.