ScholarGate
دستیار

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

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

رگرسیون لسو×رگرسیون پواسون و دوجمله‌ای منفی×
حوزهیادگیری ماشیناقتصادسنجی
خانوادهMachine learningRegression model
سال پیدایش19961998
پدیدآورTibshirani, R.Cameron & Trivedi (textbook treatment); Hilbe (negative binomial)
نوعRegularized linear regression (L1 penalty)Generalized linear model for count data
منبع بنیادینTibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗Cameron, A. C. & Trivedi, P. K. (1998). Regression Analysis of Count Data. Cambridge University Press. DOI ↗
نام‌های دیگرLASSO Regresyonu, lasso, L1-regularized regression, L1 regularizationcount regression, log-linear count model, negative binomial regression, Poisson / Negatif Binom Regresyon
مرتبط44
خلاصه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.Poisson regression is a generalized linear model for count outcomes — events tallied as non-negative integers such as hospital admissions, accidents, or article counts. It models the log of the expected count as a linear function of the predictors, and is developed in the standard count-data treatment of Cameron and Trivedi (1998); when the counts are over-dispersed, the closely related negative binomial model (Hilbe, 2011) is preferred.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

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

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