Learning a Self-Expressive Network for Subspace Clustering
This addresses the limitation of existing subspace clustering methods that lack generalization and scalability, offering a solution for researchers and practitioners in machine learning and computer vision.
The paper tackles the problem of subspace clustering by proposing a Self-Expressive Network (SENet) that learns self-expressive coefficients via a neural network, enabling generalization to out-of-sample data and handling large-scale datasets, with results showing competitive performance on MNIST, Fashion MNIST, and Extended MNIST, and state-of-the-art performance on CIFAR-10.
State-of-the-art subspace clustering methods are based on self-expressive model, which represents each data point as a linear combination of other data points. However, such methods are designed for a finite sample dataset and lack the ability to generalize to out-of-sample data. Moreover, since the number of self-expressive coefficients grows quadratically with the number of data points, their ability to handle large-scale datasets is often limited. In this paper, we propose a novel framework for subspace clustering, termed Self-Expressive Network (SENet), which employs a properly designed neural network to learn a self-expressive representation of the data. We show that our SENet can not only learn the self-expressive coefficients with desired properties on the training data, but also handle out-of-sample data. Besides, we show that SENet can also be leveraged to perform subspace clustering on large-scale datasets. Extensive experiments conducted on synthetic data and real world benchmark data validate the effectiveness of the proposed method. In particular, SENet yields highly competitive performance on MNIST, Fashion MNIST and Extended MNIST and state-of-the-art performance on CIFAR-10. The code is available at https://github.com/zhangsz1998/Self-Expressive-Network.