$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation

Daniel Greenhut, Dan Feldman

Given an integer $k\ge 1$ and a set $P$ of $n$ points in $\REAL^d$, the classic $k$-PCA (Principle Component Analysis) approximates the affine \emph{$k$-subspace mean} of $P$, whic…