earf

Calls <code>adversarial_rf</code>, <code>forde</code> and <code>expct</code>.
For repeated application, it is faster to save outputs of <code>adversarial_rf</code>
and <code>forde</code> and pass them via <code>...</code> or directly use <code>expct</code>.

Adversarial random forests (ARFs) recursively partition data into
fully factorized leaves, where features are jointly independent. The
procedure is iterative, with alternating rounds of generation and
discrimination. Data becomes increasingly realistic at each round, until
original and synthetic samples can no longer be reliably distinguished.
This is useful for several unsupervised learning tasks, such as density
estimation and data synthesis. Methods for both are implemented in this
package. ARFs naturally handle unstructured data with mixed continuous and
categorical covariates. They inherit many of the benefits of random forests,
including speed, flexibility, and solid performance with default parameters.
For details, see Watson et al. (2023) <https://proceedings.mlr.press/v206/watson23a.html>.

Marvin Wright

Adversarial Random Forests

Marvin N. Wright

David S. Watson

Kristin Blesch

Jan Kapar

earf function

<dl><dt>x</dt>
<dd>Input data. Integer variables are recoded as ordered factors with
a warning. See Details.</dd>
<dt>...</dt>
<dd>Extra parameters to be passed to <code>adversarial_rf</code>, <code>forde</code>
and <code>expct</code>.</dd></dl>

Arguments

Shortcut expectation function — earf

<dl>

<dt>x</dt>
<dd>Input data. Integer variables are recoded as ordered factors with
a warning. See Details.</dd>


<dt>...</dt>
<dd>Extra parameters to be passed to <code>adversarial_rf</code>, <code>forde</code>
and <code>expct</code>.</dd>

</dl>

earf: Shortcut expectation function

Description

Usage

Value

Arguments

References

See Also

Examples