R-PUlasso (R/R-PUlasso) Updated: 6 months, 3 weeks ago Add to my watchlist

High-dimensional variable selection with presence-only data

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.

Version: 3.2.5 License: GPL-2 GitHub
Displaying statistics for 1,036 users who made submissions during: until

Statistics for selected duration

2024-Jun-20 to 2024-Jul-20


Total Installations 1
Requested Installations 1


macOS Versions

Loading Chart

Port Versions

Loading Chart



Xcode Versions

Loading Chart

CLT Versions

Loading Chart



Variants table

Variants Count


Monthly Statistics

Can remain cached for up to 24 hours