ScholarGate
Асистент

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

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

К-най-близки съседи×Логистична регресия×
ОбластМашинно обучениеСтатистика за изследвания
СемействоMachine learningProcess / pipeline
Година на възникване19671958
СъздателCover, T.M. & Hart, P.E.David Roxbee Cox
ТипInstance-based (non-parametric) learningMethod
Основополагащ източникCover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗
Други названияKNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learninglogit model, binomial logistic regression, LR
Свързани53
Резюме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.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.
ScholarGateНабор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: K-Nearest Neighbors · Logistic Regression. Извлечено на 2026-06-18 от https://scholargate.app/bg/compare