mutPolynomialInt

<code>[integer]</code> integer vector/individual to mutate.

further arguments passed on to the method.

<code>[integer]</code> vector of minimal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.

lower

<code>[integer]</code> vector of maximal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.

upper

Performs simultaneous hyperparameter tuning and
feature selection through both single-objective and multi-objective
optimization as described in Binder, Moosbauer et al. (2019) <arXiv:1912.12912>.
Uses the 'ecr'-package as basis but adds mixed integer
evolutionary strategies and multi-fidelity functionality as well as operators
specific for the problem of feature selection.

Martin Binder

mosmafs

Multi-Objective Simultaneous Model and Feature Selection

Susanne Dandl

Julia Moosbauer

mutPolynomialInt function

<dl><dt>ind</dt>
<dd><code>[integer]</code> integer vector/individual to mutate.</dd>
<dt>...</dt>
<dd>further arguments passed on to the method.</dd>
<dt>lower</dt>
<dd><code>[integer]</code> vector of minimal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.</dd>
<dt>upper</dt>
<dd><code>[integer]</code> vector of maximal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.</dd></dl>

Arguments

Integer Polynomial Mutator — mutPolynomialInt

<dl>

<dt>ind</dt>
<dd><code>[integer]</code> integer vector/individual to mutate.</dd>


<dt>...</dt>
<dd>further arguments passed on to the method.</dd>


<dt>lower</dt>
<dd><code>[integer]</code> vector of minimal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.</dd>


<dt>upper</dt>
<dd><code>[integer]</code> vector of maximal values for each parameter of the
decision space. Must have the same length as <code>ind</code>.</dd>

</dl>

mutPolynomialInt: Integer Polynomial Mutator

Description

Usage

Value

Arguments

See Also