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>.

An algorithm that trains a meta-learning procedure that combines 
    screening and wrapper methods to find a set of extremely low-dimensional attribute 
    combinations. This package works on top of the 'caret' package and proceeds in a 
    forward-step manner. More specifically, it builds and tests learners starting 
    from very few attributes until it includes a maximal number of attributes by 
    increasing the number of attributes at each step. Hence, for each fixed number
    of attributes, the algorithm tests various (randomly selected) learners and 
    picks those with the best performance in terms of training error. Throughout,
    the algorithm uses the information coming from the best learners at the previous
    step to build and test learners in the following step. In the end, it outputs
    a set of strong low-dimensional learners.

A collection of 'HTML', 'JavaScript', and 'CSS' assets that
  dynamically generate beautiful documentation from a 'Swagger' compliant API:
  <https://swagger.io/specification/>.

Provides a fast implementation of the SWAG algorithm for Generalized Linear Models which allows to perform a meta-learning procedure that combines 
    screening and wrapper methods to find a set of extremely low-dimensional attribute combinations. The package then performs test on the network of selected models to identify the variables that are highly predictive by using entropy-based network measures.

Collection of functions to connect the structure of the data with the information on the samples. Three types of associations are covered: 1. linear model of principal components. 2. hierarchical clustering analysis. 3. distribution of features-sample annotation associations. Additionally, the inter-relation between sample annotations can be analyzed. Simple methods are provided for the correction of batch effects and removal of principal components.