dkde

<p>Used within bisection algorithm to find the location of the best hyperplane orthogonal to a given projection vector. Not intended for use outside of functions f_md and df_md</p>

internal

Implements recently developed projection
pursuit algorithms for finding optimal linear cluster
separators. The clustering algorithms use optimal
hyperplane separators based on minimum density, Pavlidis et. al (2016) <http://jmlr.org/papers/volume17/15-307/15-307.pdf>;
minimum normalised cut, Hofmeyr (2017) <doi:10.1109/TPAMI.2016.2609929>;
and maximum variance ratio clusterability, Hofmeyr and Pavlidis (2015) <doi:10.1109/SSCI.2015.116>.

David Hofmeyr

dkde: Gradient of the Penalised Density at a Point

Description

Arguments