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/ko/compare