Uporedite metode
Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.
| K-Nearest Neighbors× | Дрво одлучивања× | Logistička regresija× | |
|---|---|---|---|
| Oblast≠ | Mašinsko učenje | Mašinsko učenje | Istraživačka statistika |
| Porodica≠ | Machine learning | Machine learning | Process / pipeline |
| Godina nastanka≠ | 1967 | 1984 | 1958 |
| Tvorac≠ | Cover, T.M. & Hart, P.E. | Breiman, Friedman, Olshen & Stone | David Roxbee Cox |
| Tip≠ | Instance-based (non-parametric) learning | Recursive partitioning (if-then rules) | Method |
| Temeljni izvor≠ | Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| Drugi nazivi≠ | 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 |
| Srodne≠ | 5 | 5 | 3 |
| Sažetak≠ | 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. |
| ScholarGateSkup podataka ↗ |
|
|
|