השוואת שיטות

	שיטת השכנים הקרובים ביותר (K-Nearest Neighbors)	עץ החלטה	רגרסיה לוגיסטית	יער אקראי
תחום	למידת מכונה	למידת מכונה	סטטיסטיקה למחקר	למידת מכונה
משפחה	Machine learning	Machine learning	Process / pipeline	Machine learning
שנת המקור	1967	1984	1958	2001
הוגה השיטה	Cover, T.M. & Hart, P.E.	Breiman, Friedman, Olshen & Stone	David Roxbee Cox	Breiman, L.
סוג	Instance-based (non-parametric) learning	Recursive partitioning (if-then rules)	Method	Ensemble (bagging of decision trees)
מקור מכונן	Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	5	5	3	4
תקציר	K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values.	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.	Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science.	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.