Installation
About
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.org/abs/1711.08129 | |
| Bug report | File report |
Key Metrics
Downloads
| Yesterday | 3 -57% |
| Last 7 days | 70 -4% |
| Last 30 days | 249 -17% |
| Last 90 days | 865 +1% |
| Last 365 days | 2.344 +16% |