SPSP (Q114376)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Selection by Partitioning the Solution Paths
Language Label Description Also known as
default for all languages
No label defined
    English
    SPSP
    Selection by Partitioning the Solution Paths

      Statements

      0 references
      0.1.1
      22 February 2022
      0 references
      0.1.0
      2 August 2021
      0 references
      0.2.0
      22 October 2023
      0 references
      0 references
      0 references
      22 October 2023
      0 references
      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.
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      Yang Liu
      0 references
      Peng Wang
      0 references

      Identifiers

      0 references