swa
Subsampling Winner Algorithm for Classification
This algorithm conducts variable selection in the classification setting. It repeatedly subsamples variables and runs linear discriminant analysis (LDA) on the subsampled variables. Variables are scored based on the AUC and the t-statistics. Variables then enter a competition and the semi-finalist variables will be evaluated in a final round of LDA classification. The algorithm then outputs a list of variable selected. Qiao, Sun and Fan (2017) <http://people.math.binghamton.edu/qiao/swa.html>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.8.1 |
rolling linux/jammy R-4.5 | swa_0.8.1.tar.gz |
21.4 KiB |
0.8.1 |
rolling linux/noble R-4.5 | swa_0.8.1.tar.gz |
21.3 KiB |
0.8.1 |
rolling source/ R- | swa_0.8.1.tar.gz |
4.1 KiB |
0.8.1 |
latest linux/jammy R-4.5 | swa_0.8.1.tar.gz |
21.4 KiB |
0.8.1 |
latest linux/noble R-4.5 | swa_0.8.1.tar.gz |
21.3 KiB |
0.8.1 |
latest source/ R- | swa_0.8.1.tar.gz |
4.1 KiB |
0.8.1 |
2026-04-26 source/ R- | swa_0.8.1.tar.gz |
4.1 KiB |
0.8.1 |
2026-04-23 source/ R- | swa_0.8.1.tar.gz |
4.1 KiB |
0.8.1 |
2026-04-09 windows/windows R-4.5 | swa_0.8.1.zip |
23.7 KiB |
0.8.1 |
2025-04-20 source/ R- | swa_0.8.1.tar.gz |
4.1 KiB |