Entropy-Constrained and Sparse Relation-Constrained Subspace Clustering
DOI:
https://doi.org/10.54097/54czr459Keywords:
SSC, Information Entropy, Feature Weighting, Relation-ConstraintAbstract
This paper proposes a novel Entropy-Constrained and Sparse Relation-Constrained Subspace Clustering (ECSSC). By integrating information entropy weighting with sparse representation, the proposed method enhances both the accuracy and robustness of high-dimensional data clustering. Key improvements include: the introduction of an information entropy weight matrix to quantify feature discriminability and improve adaptability to noise and redundant features; the use of Frobenius norm constraints on the coefficient matrix to balance computational efficiency and model performance; and the incorporation of block-diagonal constraints to refine the sparsity structure of subspaces. Experiments conducted on three image datasets—MNIST, ORL, and COIL20—demonstrate that EWSSC outperforms traditional methods, classical sparse subspace clustering algorithms, and related state-of-the-art variants in terms of clustering accuracy (ACC), normalized mutual information (NMI), and adjusted Rand index (ARI). Notably, on the ORL dataset, ECSSC achieved an NMI of 0.9031, representing a 6.18% improvement over Sparse Representation-based Clustering (SRR). Ablation studies further confirm the effectiveness of the entropy-weighting module, which contributes to an average performance gain of 10%–18% across different datasets.
Downloads
References
[1] Wang W W, Li X P, Feng X C, et al. A survey on sparse subspace clustering[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 41(8): 1373-1384.
[2] Ouyang P P. Research on Improved Sparse Subspace Clustering Algorithm[D]. Qingdao University, 2015.
[3] Xue X Q. Research on Low-Rank Subspace Clustering Algorithm and Its Application[D]. Southwest University of Science and Technology, 2021.
[4] Dong W H. Research on Sparse Subspace Clustering and Its Application[D]. Jiangnan University, 2019. (in Chinese)
[5] Chen H Z. Research on Subspace Clustering Analysis and Application of High-Dimensional Data[D]. Xidian University, 2019.
[6] Vidal R. Sparse subspace clustering[C]//2009 IEEE Conference on Computer Vision and Pattern Recognition. Miami, USA: IEEE, 2009: 2790-2797.
[7] Elhamifar E, Vidal R. Sparse subspace clustering: Algorithm, theory, and applications[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(11): 2765-2781.
[8] Liu G, Lin Z, Yu Y. Robust subspace segmentation by low-rank representation[C]//Proceedings of the 27th International Conference on Machine Learning. Haifa, Israel: OmniPress, 2010: 663-670.
[9] Liu G, Lin Z, Yan S, et al. Robust recovery of subspace structures by low-rank representation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(1): 171-184.
[10] Lu C, Min H, Zhao Z, et al. Robust and efficient subspace segmentation via least squares regression[C]//Proceedings of the 12th European Conference on Computer Vision. Florence, Italy: Springer, 2012: 347-360.
[11] Patel V M, Vidal R. Kernel sparse subspace clustering[C]//2014 IEEE International Conference on Image Processing. Paris, France: IEEE, 2014: 2849-2853.
[12] [12] You C, Robinson D, Vidal R. Scalable sparse subspace clustering by orthogonal matching pursuit[C]//2016 IEEE Conference on Computer Vision and Pattern Recognition. Las Vegas, USA: IEEE, 2016: 3918-3927.
[13] Li C G, Vidal R. Structured sparse subspace clustering: a unified optimization framework[C]//2015 IEEE Conference on Computer Vision and Pattern Recognition. Boston, USA: IEEE, 2015: 277-286.
[14] Li H Y, Wang H Y. Subspace clustering method based on $TL_1$ norm constraint[J]. Journal of Electronics & Information Technology, 2017, 39(10): 2428-2436.
[15] Lu G F, Tang R, Yao L. Dual structure least squares regression for subspace clustering[J]. Journal of Nanjing University (Natural Science), 2022, 58(6): 1050-1058.
[16] Wei L, Ji F, Liu H, et al. Subspace clustering via structured sparse relation representation[J]. IEEE Transactions on Neural Networks and Learning Systems, 2022, 33(9): 4610-4623.
[17] Hu H Q, Zhang W Q, Xu C. Discriminatively enhanced sparse subspace clustering[J]. Computer Engineering and Applications, 2023, 49(2): 98-104.
[18] Liu Z Y, Wang H W, Zhao Q. Self-weighted scaled simplex representation for subspace clustering[J]. Journal of Beijing University of Aeronautics and Astronautics. https://doi.org/10.13700/j.bh.1001-5965.2023.0617
[19] Li T, Wang W W, Zhai D, et al. Weighted sparse subspace clustering for image segmentation[J]. Journal of Systems Engineering and Electronics, 2014, 36(3): 580-585.
[20] Zhang H, Zhai H, Zhang L, et al. Spectral-spatial sparse subspace clustering for hyperspectral remote sensing images[J]. IEEE Transactions on Geoscience and Remote Sensing, 2016, 54(6): 3672-3684.
[21] Li W Z, Deng X Q, Liu F C. Subspace clustering algorithm fused three-dimensional spatial spectral features of hyperspectral images[J]. Application Research of Computers, 2019, 36(11): 3496-3498.
[22] Long Y H, Deng X Q, Wang Z W, et al. Weighted block sparse subspace clustering algorithm based on information entropy[J]. Journal of Data Acquisition and Processing, 2021, 36(3): 544-555.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Journal of Computing and Electronic Information Management
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
