rUnifSplit

An iterative implementation of a recursive binary partitioning algorithm to measure pairwise dependence with a modular design that allows user specification of the splitting logic and stop criteria. Helper functions provide suggested versions of both and support visualization and the computation of summary statistics on final binnings. For a complete description of the functionality and algorithm, see Salahub and Oldford (2023) <doi:10.48550/arXiv.2311.08561>.

Chris Salahub

AssocBin

Measuring Association with Recursive Binning

rUnifSplit function

<dl><dt>bin</dt>
<dd>a bin to be split with elements `x`, `y`, `depth`,
`bnds` (list with elements `x` and `y`), `expn`, `n`</dd>
<dt>minExp</dt>
<dd>numeric giving the minimum expected count allowed
in a bin</dd>
<dt>squarify</dt>
<dd>logical value, should we force splitting on
the longer side?</dd></dl>

Arguments

Author

Random uniform splitting — rUnifSplit

<dl>

<dt>bin</dt>
<dd>a bin to be split with elements `x`, `y`, `depth`,
`bnds` (list with elements `x` and `y`), `expn`, `n`</dd>


<dt>minExp</dt>
<dd>numeric giving the minimum expected count allowed
in a bin</dd>


<dt>squarify</dt>
<dd>logical value, should we force splitting on
the longer side?</dd>

</dl>

rUnifSplit: Random uniform splitting

Description

Usage

Value

Arguments

Author

Details

Examples