Robust subspace clustering via two-way manifold representation

Subspace clustering has shown great potential in discovering the hidden low-dimensional subspace structures in high-dimensional data. However, most existing methods still face the problem of noise distortion and overlapping subspaces. To tackle this problem and ensure that each sample is only assigned to a single subspace, a new method is proposed in this paper. Specifically, a two-way learning technique is introduced by inducing data manifold via two representative structures. The first is a low-rank structure learned directly from original data. The second structure is an affinity matrix obtained via a \(k\) $k$ symmetric nearest neighbor graph. By further introducing a dual regularization term, both structures are allowed to guild themselves adaptively to find robust clustering directly without spectral post-processing. In order to evaluate the effectiveness of the proposed method, several experiments are conducted on multiple benchmark datasets. The experimental results, evaluated using six standard metrics, clearly demonstrate that the proposed method outperforms state-of-the-art methods.