k_searching_forward

k_searching_backward

boundary_found

<p>a <code>partition_step</code> object</p>

.partition_step

<p><code>k_searching_forward()</code> and <code>k_searching_backward()</code> check the direction of
the <code>k</code> search metric. <code>boundary_found()</code> checks if the last value of <code>k</code> was
under the threshold while the current value is over</p>

internal

A fast and flexible framework for agglomerative partitioning. 'partition' uses an approach
called Direct-Measure-Reduce to create new variables that maintain the
user-specified minimum level of information. Each reduced variable is also interpretable:
the original variables map to one and only one variable in the reduced data set. 'partition'
is flexible, as well: how variables are selected to reduce, how information loss is measured,
and the way data is reduced can all be customized.

Malcolm Barrett

partition

Agglomerative Partitioning Framework for Dimension Reduction

Joshua Millstein

k_searching_forward function

Assess <code>k</code> search — k_searching_forward

Assess <code>k</code> search

k_searching_forward: Assess `k` search

Description

Usage

Arguments

Value