ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Дърво на решенията×Йерархично групиране×Клъстериране с К-средни×
ОбластМашинно обучениеМашинно обучениеМашинно обучение
СемействоMachine learningMachine learningMachine learning
Година на възникване198419631967
СъздателBreiman, Friedman, Olshen & StoneWard, J. H.MacQueen, J.
ТипRecursive partitioning (if-then rules)Unsupervised clustering (agglomerative)Partitional clustering (centroid-based)
Основополагащ източникBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗
Други названияKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Свързани543
Резюме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.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.K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.
ScholarGateНабор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Decision Tree · Hierarchical Clustering · K-Means Clustering. Извлечено на 2026-06-19 от https://scholargate.app/bg/compare