R-PUlasso (R/R-PUlasso) Updated: 1 year ago Add to my watchlist
High-dimensional variable selection with presence-only dataEfficient 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.
Version: 3.2.5 License: GPL-2
GitHub
Statistics for selected duration
2024-Dec-16 to 2025-Jan-15
No stats available for this selection.
Try changing the range of days. Alternatively visit statistics page to have an overall look at the submitted statistics.