Efficient algorithm for solving PU (Positive and Unlabeled) problem in low or high dimensional setting with lasso or group lasso penalty. The algorithm uses Maximization-Minorization and (block) coordinate descent. Sparse calculation and parallel computing are supported for the computational speed-up. See Hyebin Song, Garvesh Raskutti (2018) <arXiv:1711.08129>.
| Version: | 3.2.3 |
| Depends: | R (≥ 2.10) |
| Imports: | Rcpp (≥ 0.12.8), methods, Matrix, doParallel, foreach, ggplot2 |
| LinkingTo: | Rcpp, RcppEigen, Matrix |
| Suggests: | testthat, knitr, rmarkdown |
| Published: | 2019-04-28 |
| Author: | Hyebin Song [aut, cre], Garvesh Raskutti [aut] |
| Maintainer: | Hyebin Song <hsong56 at wisc.edu> |
| BugReports: | https://github.com/hsong1/PUlasso/issues |
| License: | GPL-2 |
| URL: | https://arxiv.org/abs/1711.08129 |
| NeedsCompilation: | yes |
| CRAN checks: | PUlasso results |
| Reference manual: | PUlasso.pdf |
| Vignettes: |
PUlasso-vignette |
| Package source: | PUlasso_3.2.3.tar.gz |
| Windows binaries: | r-devel: PUlasso_3.2.3.zip, r-release: PUlasso_3.2.3.zip, r-oldrel: PUlasso_3.2.3.zip |
| macOS binaries: | r-release: PUlasso_3.2.3.tgz, r-oldrel: PUlasso_3.2.3.tgz |
| Old sources: | PUlasso archive |
Please use the canonical form https://CRAN.R-project.org/package=PUlasso to link to this page.