SPSP
Selection by Partitioning the Solution Paths
An implementation of the feature Selection procedure by Partitioning the entire Solution Paths (namely SPSP) to identify the relevant features rather than using a single tuning parameter. By utilizing the entire solution paths, this procedure can obtain better selection accuracy than the commonly used approach of selecting only one tuning parameter based on existing criteria, cross-validation (CV), generalized CV, AIC, BIC, and extended BIC (Liu, Y., & Wang, P. (2018) doi:10.1214/18-EJS1434). It is more stable and accurate (low false positive and false negative rates) than other variable selection approaches. In addition, it can be flexibly coupled with the solution paths of Lasso, adaptive Lasso, ridge regression, and other penalized estimators.
- Version0.2.0
- R version≥ 3.5.0
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- Last release10/22/2023
Documentation
Team
Xiaorui (Jeremy) Zhu
Peng Wang
Show author detailsRolesAuthorYang Liu
Show author detailsRolesAuthor
Insights
Last 30 days
Last 365 days
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
- Imports5 packages
- Suggests2 packages
- Linking To1 package