Amaldi, Edoardo; Coniglio, Stefano - In: European Journal of Operational Research 227 (2013) 1, pp. 22-29
We consider the k-Hyperplane Clustering problem where, given a set of m points in Rn, we have to partition the set into k subsets (clusters) and determine a hyperplane for each of them, so as to minimize the sum of the squares of the Euclidean distances between the points and the hyperplane of...