Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Semi-supervised sparse subspace clustering with manifold regularization

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

For sparse subspace clustering methods, it is crucial to develop a good representation matrix to capture the data structure. In this paper, we incorporated the label information into sparse representation and proposed a new semi-supervised sparse subspace clustering method, named semi-supervised sparse subspace clustering with manifold regularization (S\(^4\)CMR). When developing the sparse self-expressive matrix, the S\(^4\)CMR method utilized the label information to constrain the development of expressiveness coefficients. The local manifold regularization was also integrated to enhance clustering stability and local consistency. By utilizing the Alternating Direction Method of Multipliers (ADMM), the convex optimization problem associated with linear constraints can be easily resolved. The developed similarity matrix can provide strong discriminant information, making it more effective for semi-supervised tasks. The effectiveness of the proposed algorithm is demonstrated through experiments on benchmark data sets, such as motion segmentation and image clustering.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Algorithm 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability and access

All data used in this study are public, and all data analyzed during this study will be made available on request.

References

  1. Croitoru I, Bogolin S-V, Leordeanu M (2019) Unsupervised learning of foreground object segmentation. Int J Comput Vision 127:1279–1302

    Article  Google Scholar 

  2. Xia W, Zhang X, Gao Q, Gao X (2021) Adversarial self-supervised clustering with cluster-specificity distribution. Neurocomputing 449:38–47

    Article  Google Scholar 

  3. Golalipour K, Akbari E, Hamidi SS, Lee M, Enayatifar R (2021) From clustering to clustering ensemble selection: A review. Eng Appl Artif Intell 104:104388

    Article  Google Scholar 

  4. Cai Y, Zeng M, Cai Z, Liu X, Zhang Z (2021) Graph regularized residual subspace clustering network for hyperspectral image clustering. Inf Sci 578:85–101

    Article  MathSciNet  Google Scholar 

  5. Xue X et al (2020) Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel. Inf Sci 513:190–205

    Article  MathSciNet  Google Scholar 

  6. Li W et al (2023) Feature selection approach based on improved fuzzy c-means with principle of refined justifiable granularity. IEEE Trans Fuzzy Syst 31:2112–2126

    Article  Google Scholar 

  7. Wu S, Zheng W-S (2022) Semisupervised feature learning by deep entropy-sparsity subspace clustering. IEEE Trans Neural Netw Learn Syst 33:774–788

    Article  Google Scholar 

  8. Li W, Wei Y, Xu W (2022) General expression of knowledge granularity based on a fuzzy relation matrix. Fuzzy Sets Syst 440:149–163

    Article  MathSciNet  Google Scholar 

  9. Li W et al (2023) Double-quantitative feature selection approach for multi-granularity ordered decision systems. IEEE Trans Artif Intell

  10. Parsa MG, Zare H, Ghatee M (2020) Unsupervised feature selection based on adaptive similarity learning and subspace clustering. Eng Appl Artif Intell 95:103855

    Article  Google Scholar 

  11. Li W, Zhou H, Xu W, Wang X-Z, Pedrycz W (2022) Interval dominance-based feature selection for interval-valued ordered data. IEEE Trans Neural Netw Learn Syst 34:6898–6912

    Article  MathSciNet  Google Scholar 

  12. Qin Y, Wu H, Feng G (2021) Structured subspace learning-induced symmetric nonnegative matrix factorization. Signal Process 186:108115

    Article  Google Scholar 

  13. Wei L et al (2021) Subspace clustering via structured sparse relation representation. IEEE Trans Neural Netw Learn Syst 33:4610–4623

    Article  MathSciNet  Google Scholar 

  14. Xu G, Yang M, Wu Q (2019) Sparse subspace clustering with low-rank transformation. Neural Comput Appl 31:3141–3154

    Article  Google Scholar 

  15. Elhamifar E, Vidal R (2013) Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35:2765–2781

    Article  Google Scholar 

  16. Rafiezadeh Shahi K et al (2020) Hierarchical sparse subspace clustering (hessc): An automatic approach for hyperspectral image analysis. Remote Sens 12:2421

    Article  Google Scholar 

  17. Liu G et al (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell 35:171–184

    Article  Google Scholar 

  18. Lu C-Y et al (2012) Robust and efficient subspace segmentation via least squares regression, 347–360

  19. Li Q, Zhao X, Zhu H (2023) Semi-supervised sparse subspace clustering based on re-weighting. Eng Lett 31:113–121

    Google Scholar 

  20. Xu B, Zeng Z, Lian C, Ding Z (2021) Semi-supervised low-rank semantics grouping for zero-shot learning. IEEE Trans Image Process 30:2207–2219

    Article  Google Scholar 

  21. Jia Y, Lu G, Liu H, Hou J (2023) Semi-supervised subspace clustering via tensor low-rank representation. IEEE Trans Circuits Syst Video Technol 33:3455–3461

    Article  Google Scholar 

  22. Deng T, Wang J, Jia Q, Yang M (2023) Semi-supervised sparse representation collaborative clustering of incomplete data. Appl Intell 53:31077–31105

    Article  Google Scholar 

  23. Liang R, Bai Y, Lin HX (2020) A splitting method for the locality regularized semi-supervised subspace clustering. Optimization 69:1069–1096

    Article  MathSciNet  Google Scholar 

  24. Li S, Li W, Hu J, Li Y (2022) Semi-supervised bi-orthogonal constraints dual-graph regularized nmf for subspace clustering. Appl Intell 52:3227–3248

    Article  Google Scholar 

  25. Huang S, Pižurica Zhang H, A, (2019) Semisupervised sparse subspace clustering method with a joint sparsity constraint for hyperspectral remote sensing images. IEEE J Selected Topics Appl Earth Observations Remote Sens 12:989–999

  26. Zhou D, Bousquet O, Lal T, Weston J, Schölkopf B (2003) Learning with local and global consistency. Adv Neural Inf Process Syst 16

  27. Kang Z et al (2021) Structured graph learning for clustering and semi-supervised classification. Pattern Recognition 110:107627

    Article  Google Scholar 

  28. Jia Y, Kwong S, Hou J (2018) Semi-supervised spectral clustering with structured sparsity regularization. IEEE Signal Process Lett 25:403–407

    Article  Google Scholar 

  29. Fang X, Xu Y, Li X, Lai Z, Wong WK (2015) Robust semi-supervised subspace clustering via non-negative low-rank representation. IEEE Trans Cybernetics 46:1828–1838

    Article  Google Scholar 

  30. Wang D, Yin Q, He R, Wang L, Tan T (2014) Semi-supervised subspace segmentation, 2854–2858

  31. Zhuang L et al (2017) Label information guided graph construction for semi-supervised learning. IEEE Trans Image Process 26:4182–4192

    Article  MathSciNet  Google Scholar 

  32. Qin Y, Wu H, Zhang X, Feng G (2021) Semi-supervised structured subspace learning for multi-view clustering. IEEE Trans Image Process 31:1–14

    Article  Google Scholar 

  33. Tron R, Vidal R (2007) A benchmark for the comparison of 3-d motion segmentation algorithms, 1–8

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China under Grant 12031003, Grant 12101477.

Author information

Authors and Affiliations

Authors

Contributions

Zhiwei Xing: Conceptualization and writing-Original Draft. Jigen Peng: Methodology, supervision, formal analysis. Xingshi He: Methodology, supervision, and writing-review. Mengnan Tian: Formal analysis and editing. All authors have read and agreed to the submitted version of the manuscript.

Corresponding author

Correspondence to Zhiwei Xing.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xing, Z., Peng, J., He, X. et al. Semi-supervised sparse subspace clustering with manifold regularization. Appl Intell 54, 6836–6845 (2024). https://doi.org/10.1007/s10489-024-05535-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-024-05535-6

Keywords