Compară metode

	Arbore de decizie	Regresia Logistică	Mașina cu Vectori Suport (Clasificare)
Domeniu	Învățare automată	Statistică pentru cercetare	Învățare automată
Familie	Machine learning	Process / pipeline	Machine learning
Anul apariției	1984	1958	1995
Autorul original	Breiman, Friedman, Olshen & Stone	David Roxbee Cox	Cortes, C. & Vapnik, V.
Tip	Recursive partitioning (if-then rules)	Method	Maximum-margin classifier (kernel method)
Sursa seminală	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.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
Denumiri alternative	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	logit model, binomial logistic regression, LR	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Înrudite	5	3	5
Rezumat	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.	The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.