Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://cran.rstudio.com/web/packages/uwot/../Rcpp/../RcppFastAD/../Rcpp/../tlars/readme/README.html below:

README

Title: The T-LARS Algorithm: Early-Terminated Forward Variable Selection

Description: It computes the solution path of the Terminating-LARS (T-LARS) algorithm. The T-LARS algorithm appends dummy predictors to the original predictor matrix and terminates the forward-selection process after a pre-defined number of dummy variables has been selected.

Paper: The package is based on the paper

J. Machkour, M. Muma, and D. P. Palomar, “The terminating-random experiments selector: Fast high-dimensional variable selection with false discovery rate control,” arXiv preprint arXiv:2110.06048, 2022. (https://doi.org/10.48550/arXiv.2110.06048)

Note: The T-LARS algorithm is a major building block of the T-Rex selector (Paper and R package). The T-Rex selector performs terminated-random experiments (T-Rex) using the T-LARS algorithm and fuses the selected active sets of all random experiments to obtain a final set of selected variables. The T-Rex selector provably controls the false discovery rate (FDR), i.e., the expected fraction of selected false positives among all selected variables, at the user-defined target level while maximizing the number of selected variables.

In the following, we show how to use the package and give you an idea of why terminating the solution path early is a reasonable approach in high-dimensional and sparse variable selection: In many applications, most active variables enter the solution path early!

You can install the ‘tlars’ package (stable version) from CRAN with

You can install the ‘tlars’ package (developer version) from GitHub with

You can open the help pages with

To cite the package ‘tlars’ in publications use:

In the following, we illustrate the basic usage of the ‘tlars’ package to perform variable selection in sparse and high-dimensional regression settings using the T-LARS algorithm.

1. First, we generate a high-dimensional Gaussian data set with sparse support:

1. Second, we generate a dummy matrix containing n rows and num_dummies dummy predictors that are sampled from the standard normal distribution and append it to the original predictor matrix:

1. Third, we generate an object of the C++ class ‘tlars_cpp’ and supply the information that the last num_dummies predictors in XD are dummy predictors:

1. Finally, we perform three T-LARS steps on ‘mod_tlars’, i.e., the T-LARS algorithm is run until T_stop = 3 dummies have entered the solution path and stops there. For comparison, we also compute the whole solution path by setting early_stop = FALSE:

4.1. Perform three T-LARS steps on object ‘mod_tlars’:

tlars(model = mod_tlars, T_stop = 3, early_stop = TRUE) # Perform three T-LARS steps on object "mod_tlars"
#> Executing T-LARS step by reference...
#>       Finished T-LARS step(s)... 
#>           - The results are stored in the C++ object 'mod_tlars'.
#>           - New value of T_stop: 3.
#>           - Time elapsed: 0.001 sec.
print(mod_tlars) # Print information about the results of the performed T-LARS steps
#> 'mod_tlars' is a C++ object of class 'tlars_cpp' ... 
#>   - Number of dummies: 150.
#>   - Number of included dummies: 3.
#>   - Selected variables: 2, 3, 1, 148, 130, 89, 82, 12, 16, 132, 147, 123.
plot(mod_tlars) # Plot the terminated solution path

4.2. Compute the whole solution path:

tlars(model = mod_tlars, early_stop = FALSE) # Compute the whole solution path
#> 'T_stop' is ignored. Computing the entire solution path...
#> Executing T-LARS step by reference...
#>       Finished T-LARS step(s). No early stopping! 
#>           - The results are stored in the C++ object 'mod_tlars'.
#>           - Time elapsed: 0.004 sec.
print(mod_tlars) # Print information about the results
#> 'mod_tlars' is a C++ object of class 'tlars_cpp' ... 
#>   - Number of dummies: 150.
#>   - Number of included dummies: 30.
#>   - Selected variables: 2, 3, 1, 148, 130, 89, 82, 12, 16, 132, 147, 123, 122, 65, 47, 107, 79, 54, 39, 62, 46, 116, 86, 102, 81, 129, 24, 41, 26, 83, 20, 28, 72, 63, 60, 94, 135, 6, 27, 7, 66, 98, 112, 111, 74.
plot(mod_tlars) # Plot the whole solution path

The T-LARS algorithm is a major building block of the T-Rex selector (Paper and R package). The T-Rex selector performs terminated-random experiments (T-Rex) using the T-LARS algorithm and fuses the selected active sets of all random experiments to obtain a final set of selected variables. The T-Rex selector provably controls the FDR at the user-defined target level while maximizing the number of selected variables. If you are working in genomics, financial engineering, or any other field that requires a fast and FDR-controlling variable/feature selection method for large-scale high-dimensional settings, then this is for you. Check it out!

For more information and some examples, please check the GitHub-vignette.

tlars package (stable version): CRAN-tlars.

tlars package (developer version): GitHub-tlars.

README file: GitHub-readme.

Vignette: GitHub-vignette.

TRexSelector package: CRAN-TRexSelector.

T-Rex paper: https://arxiv.org/abs/2110.06048

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4