Learning a subspace for clustering via pattern shrinking

Clustering is a basic technique in information processing. Traditional clustering methods, however, are not suitable for high dimensional data. Thus, learning a subspace for clustering has emerged as an important research direction. Nevertheless, the meaningful data are often lying on a low dimensional manifold while existing subspace learning approaches cannot fully capture the nonlinear structures of hidden manifold. In this paper, we propose a novel subspace learning method that not only characterizes the linear and nonlinear structures of data, but also reflects the requirements of following clustering. Compared with other related approaches, the proposed method can derive a subspace that is more suitable for high dimensional data clustering. Promising experimental results on different kinds of data sets demonstrate the effectiveness of the proposed approach.

► We proposed a novel approach which considers the requirement of clustering in subspace learning.
► We proposed pattern shrinking strategy to incorporate nonlinear structure information in learning linear subspace.
► The proposed approach is linear and has the inductive nature. It can be directly used in handling new data.