Penalized Logistic Regression Model using Majorization Minimization by Coordinate Descent (MMCD) Algorithm

cv.cvplogistic | Tuning parameter selection by k-fold cross validation for... |

cv.hybrid | Tuning parameter selection by k-fold cross validation for... |

cvplogistic | Majorization minimization by coordinate descent for concave... |

hybrid.logistic | A Lasso-concave hybrid penalty for logistic regression |

path.plot | Plot the solution path for the concave penalized logistic... |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.