ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

رگرسیون بردار پشتیبان×کی-نزدیک‌ترین همسایگان×رگرسیون لسو×
حوزهیادگیری ماشینیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learningMachine learning
سال پیدایش200419671996
پدیدآورSmola, A.J. & Schölkopf, B.Cover, T.M. & Hart, P.E.Tibshirani, R.
نوعKernel-based supervised model (epsilon-insensitive regression)Instance-based (non-parametric) learningRegularized linear regression (L1 penalty)
منبع بنیادینSmola, A.J. & Schölkopf, B. (2004). A Tutorial on Support Vector Regression. Statistics and Computing, 14, 199–222. DOI ↗Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗
نام‌های دیگرDestek Vektör Regresyonu (SVR), SVR, epsilon-SVR, support vector machine for regressionKNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learningLASSO Regresyonu, lasso, L1-regularized regression, L1 regularization
مرتبط454
خلاصهSupport Vector Regression (SVR), described in Smola and Schölkopf's 2004 tutorial, predicts a continuous outcome by fitting a function that stays within an epsilon-wide tube around the data while incurring as little error as possible. It extends the support vector machine idea from classification to regression, using a kernel to capture nonlinear relationships.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.Lasso regression, introduced by Robert Tibshirani in 1996, is a linear regression method that adds an L1 penalty to the loss so that it shrinks coefficients and performs variable selection at the same time, producing a sparse model. By driving some coefficients exactly to zero it keeps only the predictors that matter.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Support Vector Regression · K-Nearest Neighbors · Lasso Regression. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare