paper-with-me

홈 › Papers

Multiple-Instance Logistic Regression with LASSO Penalty

2016-07-13 · Ray-Bing Chen, Kuang-Hung Cheng, Sheng-Mao Chang, Shuen-Lin Jeng, Ping-Yang Chen, Chun-Hao Yang, Chi-Chun Hsia

In this work, we consider a manufactory process which can be described by a multiple-instance logistic regression model. In order to compute the maximum likelihood estimation of the unknown coefficient, an expectation-maximization algorithm is proposed, and the proposed modeling approach can be extended to identify the important covariates by adding the coefficient penalty term into the likelihood function. In addition to essential technical details, we demonstrate the usefulness of the proposed method by simulations and real examples.

📄 PDF Abstract BibTeX arXiv:1607.03615

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Logistic Regression Logistic Regression, despite its name, is a linear model for classification rather than regression. Logistic regression is also known in the literature as logit regression,…

Similar Papers 제목 키워드 기반

Sparse Private LASSO Logistic Regression

2023-04-24 · Amol Khanna, Fred Lu, Edward Raff, Brian Testa

LASSO regularized logistic regression is particularly useful for its built-in feature selection, allowing coefficients to be removed from deployment and producing sparse solutions. Differentially private versions of LASS…

feature selectionModel Selectionregression

Penalty, Shrinkage, and Preliminary Test Estimators under Full Model Hypothesis

2015-03-24 · Enayetur Raheem, A. K. Md. Ehsanes Saleh

This paper considers a multiple regression model and compares, under full model hypothesis, analytically as well as by simulation, the performance characteristics of some popular penalty estimators such as ridge regressi…

regression

Multiclass classification by sparse multinomial logistic regression

2020-03-04 · Felix Abramovich, Vadim Grinshtein, Tomer Levy

In this paper we consider high-dimensional multiclass classification by sparse multinomial logistic regression. We propose first a feature selection procedure based on penalized maximum likelihood with a complexity penal…

Classificationfeature selectionGeneral Classificationregression

First order expansion of convex regularized estimators

2019-12-01 · NeurIPS 2019 12 · Pierre Bellec, Arun Kuchibhotla

We consider first order expansions of convex penalized estimators in high-dimensional regression problems with random designs. Our setting includes linear regression and logistic regression as special cases. For a given…

Formregression

First order expansion of convex regularized estimators

2019-10-12 · Pierre C. Bellec, Arun K. Kuchibhotla

We consider first order expansions of convex penalized estimators in high-dimensional regression problems with random designs. Our setting includes linear regression and logistic regression as special cases. For a given …

Formregression