tlars
The T-LARS Algorithm: Early-Terminated Forward Variable Selection
Computes the solution path of the Terminating-LARS (T-LARS) algorithm. The T-LARS algorithm is a major building block of the T-Rex selector (see R package 'TRexSelector'). The package is based on the papers Machkour, Muma, and Palomar (2022) doi:10.48550/arXiv.2110.06048, Efron, Hastie, Johnstone, and Tibshirani (2004) doi:10.1214/009053604000000067, and Tibshirani (1996) doi:10.1111/j.2517-6161.1996.tb02080.x.
- Version1.0.1
- R versionunknown
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- tlars citation info
- Last release02/24/2024
Documentation
Team
Jasin Machkour
Daniel P. Palomar
Show author detailsRolesAuthorSimon Tien
Show author detailsRolesAuthorMichael Muma
Show author detailsRolesAuthor
Insights
Last 30 days
This package has been downloaded 519 times in the last 30 days. This could be a paper that people cite without reading. Reaching the medium popularity echelon is no small feat! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 4 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 7,997 times in the last 365 days. A solid achievement! Enough downloads to get noticed at department meetings. The day with the most downloads was Sep 11, 2024 with 72 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Suggests5 packages
- Linking To2 packages
- Reverse Imports1 package