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

	Дърво на решенията	Isolation Forest	Логистична регресия	Случайна гора
Област	Машинно обучение	Машинно обучение	Статистика за изследвания	Машинно обучение
Семейство	Machine learning	Machine learning	Process / pipeline	Machine learning
Година на възникване	1984	2008	1958	2001
Създател	Breiman, Friedman, Olshen & Stone	Liu, F.T., Ting, K.M. & Zhou, Z.-H.	David Roxbee Cox	Breiman, L.
Тип	Recursive partitioning (if-then rules)	Unsupervised ensemble (random partitioning trees)	Method	Ensemble (bagging of decision trees)
Основополагащ източник	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422.	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.
Други названия	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Свързани	5	5	3	4
Резюме	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.	Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets.	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.