{"name":"R-PUlasso","portdir":"R/R-PUlasso","version":"3.2.5","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/hsong1/PUlasso","description":"High-dimensional variable selection with presence-only data","long_description":"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.","active":true,"categories":["science","math","R"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-19","R"]},{"type":"lib","ports":["R-ggplot2","R-doParallel","R-foreach","R-CRAN-recommended","R-Rcpp","R-RcppEigen"]},{"type":"run","ports":["R"]},{"type":"test","ports":["R-knitr","R-testthat","R-rmarkdown"]}],"depends_on":[]}