Reducers are functions that tell the partition algorithm how
to reduce the data. as_reducer() is a helper function to create new
reducers to be used in partitioners. partitioners can be created with
as_partitioner().
reduce_kmeans() is efficient in that it doesn't reduce until
the closest k to the information threshold is found.
reduce_kmeans(.partition_step, search = c("binary", "linear"), n_hits = 4)a partition_step object
a partition_step object
The search method. Binary search is generally more efficient but linear search can be faster in very low dimensions.
In linear search method, the number of iterations that should be under the threshold before reducing; useful for preventing false positives.
Other reducers:
as_reducer(),
reduce_first_component(),
reduce_scaled_mean()