Preserving bilateral view structural information for subspace clustering

摘要

Subspace clustering algorithms have been found successful in various applications that involve two-dimensional data, i.e., each example of the data is a matrix. However, most of the existing methods transform the matrix-type examples to vectors in a pre-processing step, which omits and severely damages the inherent structural information of such data. In this paper, we propose a novel subspace clustering method for two-dimensional data, which is capable of extracting the most representative structural information from the data to recover the underlying grouping relationships of the data. The structural features are extracted from two views of the data and the numbers of feature spaces in both views are automatically determined by optimization. Extensive experiments confirm the effectiveness of the proposed method.