You recall $($from lectures perhaps$)$ that directly applying a feature transformation to the data can

be computationally intractable, and can be avoided if we instead write the algorithm in terms of

Page $5$

a function h that satisfies: h$($x$,$ x$0$

$)=$ h$\backslash$phi $($x$),\backslash$phi $($x

$0$

$)$i$.$ Show that the nearest mean step in $(1)$ can be

re$-$written as: