विधियों की तुलना करें

	निर्णय वृक्ष	के-मीन्स क्लस्टरिंग
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	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.	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.
उपनाम	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.