Weighted Approach to Projective Clustering

Abstract : k-means is the basic method applied in many data clustering problems. As is known, its natural modification can be applied to projection clustering by changing the cost function from the squared-distance from the point to the squared distance from the affine subspace. However, to apply thus approach we need the beforehand knowledge of the dimension.In this paper we show how to modify this approach to allow greater flexibility by using the weights over respective range of subspaces.