binary_k_search

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

.partition_step

<p>Search for best <code>k</code> using the binary search method</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

binary_k_search: Search for best `k` using the binary search method

Description

Usage

Arguments

Value