k-Plane Clustering

December 23, 2014

A fi nite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of minimizing the sum of squares of the 2-norm distances between each point and a nearest plane.

Click here to view and download the full-screen version >>

Stay Informed

Stay Informed