Penalized principal logistic regression for sparse sufficient dimension reduction

DOI10.1016/J.CSDA.2016.12.003zbMATH Open1464.62159OpenAlexW2567488862MaRDI QIDQ1654232FDOQ1654232

Authors: Seung Jun Shin, Andreas Artemiou 

Publication date: 7 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: http://orca.cf.ac.uk/96679/1/manuscript_R1_AA.pdf

Recommendations

• Penalized robust estimators in sparse logistic regression
• Principal weighted logistic regression for sufficient dimension reduction in binary classification
• Sparse logistic principal components analysis for binary data
• Penalized regression methods with sparse variables for modeling binary outcome
• Sparse Logistic Regression with Lp Penalty for Biomarker Identification
• Sparse logistic functional principal component analysis for binary data
• Sparse principal component regression for generalized linear models
• Sparse factor regression via penalized maximum likelihood estimation
• High-Dimensional Classification by Sparse Logistic Regression
• A sparse regularization approach with Log type penalty

zbMATH Keywords

sufficient dimension reductionsparse sufficient dimension reductionMax-SCAD penaltyprincipal logistic regression

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Nonparametric regression and quantile regression (62G08) Generalized linear models (logistic models) (62J12)

Cites Work

• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Measuring and testing dependence by correlation of distances
• Sliced Regression for Dimension Reduction
• Title not available (Why is that?)
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• One-step sparse estimates in nonconcave penalized likelihood models
• Testing predictor contributions in sufficient dimension reduction.
• Sliced Inverse Regression for Dimension Reduction
• On almost linearity of low dimensional projections from high dimensional data
• Variable selection using MM algorithms
• Asymptotic Statistics
• Dimension reduction for nonelliptically distributed predictors
• Regression analysis under link violation
• Contour regression: a general approach to dimension reduction
• On Directional Regression for Dimension Reduction
• Asymptotic properties of sufficient dimension reduction with a diverging number of predictors
• Shrinkage Inverse Regression Estimation for Model-Free Variable Selection
• Sparse sufficient dimension reduction
• Sparse Partial Least Squares Regression for Simultaneous Dimension Reduction and Variable Selection
• Principal support vector machines for linear and nonlinear sufficient dimension reduction
• Variable selection in quantile regression
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Graphics for Regressions With a Binary Response
• Using intraslice covariances for improved estimation of the central subspace in regression

Cited In (8)

• A brief review of linear sufficient dimension reduction through optimization
• Principal weighted logistic regression for sufficient dimension reduction in binary classification
• High-dimensional sufficient dimension reduction through principal projections
• Central quantile subspace
• Graph informed sliced inverse regression
• Entropy-based test for generalised Gaussian distributions
• On sufficient dimension reduction via principal asymmetric least squares
• A coordinate descent MM algorithm for fast computation of sparse logistic PCA

This page was built for publication: Penalized principal logistic regression for sparse sufficient dimension reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654232)