השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| עץ החלטה× | אשכול K-Means× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1984 | 1967 |
| הוגה השיטה≠ | Breiman, Friedman, Olshen & Stone | MacQueen, J. |
| סוג≠ | Recursive partitioning (if-then rules) | Partitional clustering (centroid-based) |
| מקור מכונן≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. 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 tree | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| קשורות≠ | 5 | 3 |
| תקציר≠ | 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. | 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מערך נתונים ↗ |
|
|