cvplogistic: Penalized Logistic Regression Model using Majorization Minimization by Coordinate Descent (MMCD) Algorithm
Version 3.1-0

The package uses majorization minimization by coordinate descent (MMCD) algorithm to compute the solution surface for concave penalized logistic regression model. The SCAD and MCP (default) are two concave penalties considered in this implementation. For the MCP penalty, the package also provides the local linear approximation by coordinate descant (LLA-CD) and adaptive rescaling algorithms for computing the solutions. The package also provides a Lasso-concave hybrid penalty for fast variable selection. The hybrid penalty applies the concave penalty only to the variables selected by the Lasso. For all the implemented methods, the solution surface is computed along kappa, which is a more smooth fit for the logistic model. Tuning parameter selection method by k-fold cross-validated area under ROC curve (CV-AUC) is implemented as well.

Getting started

Package details

AuthorDingfeng Jiang <[email protected]>
Date of publication2013-03-18 10:29:02
MaintainerDingfeng Jiang <[email protected]>
LicenseGPL (>= 2)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the cvplogistic package in your browser

Any scripts or data that you put into this service are public.

cvplogistic documentation built on May 29, 2017, 11:34 p.m.