PUlasso (Q5978841): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:10, 12 March 2024
High-Dimensional Variable Selection with Presence-Only Data
Language | Label | Description | Also known as |
---|---|---|---|
English | PUlasso |
High-Dimensional Variable Selection with Presence-Only Data |
Statements
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>.
0 references
18 December 2023
0 references