ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

Agrupamiento jerárquico×Análisis Discriminante Lineal (LDA×Random Forest×
CampoAprendizaje automáticoEstadísticaAprendizaje automático
FamiliaMachine learningHypothesis testMachine learning
Año de origen196319362001
Autor originalWard, J. H.Ronald A. FisherBreiman, L.
TipoUnsupervised clustering (agglomerative)Parametric linear classifier / dimensionality reductionEnsemble (bagging of decision trees)
Fuente seminalWard, 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 ↗
AliasHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringLDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysisRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Relacionados474
ResumenHierarchical 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.
ScholarGateConjunto de datos
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Hierarchical Clustering · Linear Discriminant Analysis (Classification) · Random Forest. Recuperado el 2026-06-18 de https://scholargate.app/es/compare