swagControl

A <code>integer</code> representing the maximum number of attributes per learner.

pmax

A <code>integer</code> representing the maximum number of learners per dimension explored.

A <code>double</code> representing the proportion of screening.

alpha

An <code>integer</code> that controls the reproducibility.

seed

A <code>boolean</code> for printing current progress of the algorithm.

verbose

The Spare Wrapper AlGorithm depends on some meta-parameters that are
described below.

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.

swagControl: Control for swag function

Description

Usage

Arguments

See Also