Elastic Deep Sparse Self-Representation Subspace Clustering Network
Qiao‐Ping Wang, Xiaoyun Chen, Yan Li, Yanming Lin · Neural Processing Letters · 2024
Abstract Subspace clustering model based on self-representation learning often use $$\ell _1, \ell _2$$ ℓ 1 , ℓ 2 or kernel norm to constrain self-representation matrix of the dataset. In theory, $$\ell _1$$ ℓ 1 norm can constrain the independence of subspaces, but which may lead to under-connection because the sparsity of the self-representation matrix. $$\ell _2$$ ℓ 2 and nuclear norm regularization can improve the connectivity between clusters, but which may lead to over-connection of the self-representation matrix. Because a single regularization term may cause subspaces to be over or insufficiently divided, this paper proposes an elastic deep sparse self-representation subspace clustering network (EDS-SC), which imposes sparse constraints on deep features, and introduces the elastic network regularization mixed $$\ell _1$$ ℓ 1 and $$\ell _2$$ ℓ 2 norm to constraint self-representation matrix. The network can extract deep sparse features and provide a balance between subspace independence and connectivity. Experiments on human faces, objects, and medical imaging datasets prove the effectiveness of EDS-SC network.