Skip to main content

Sparse Subspace Clustering Based on Adaptive Parameter Training

  • Conference paper
Intelligent Information Processing XI (IIP 2022)

Part of the book series: IFIP Advances in Information and Communication Technology ((IFIPAICT,volume 643))

Included in the following conference series:

  • 660 Accesses

Abstract

There are many researches on sparse subspace clustering, but there are few related studies on its parameter optimization. In this paper, we propose an adaptive training parameter method to improve the manual selection process of convex optimization regularization parameters and improve the accuracy of subspace clustering. Experiments were carried out on multiple datasets, and the clustering accuracy is improved. The results prove that the improved parameter training process can improve the clustering accuracy of subspace clustering.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dong, W.: Research of Sparse Subspace Clustering. Jiangnan University (2019). https://doi.org/10.27169/d.cnki.gwqgu.2019.000010

  2. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. ACM SIGMOD Rec. 27(2), 94–105 (1998). https://doi.org/10.1145/276305.276314

    Article  Google Scholar 

  3. Hong, W., Wright, J., Huang, K., Ma, Y.: Multi-scale hybrid linear models for lossy image representation. IEEE Trans. Image Process. 15(12), 3655–3671 (2006). https://doi.org/10.1109/TIP.2006.882016

    Article  MathSciNet  Google Scholar 

  4. Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2790–2797 (2009). https://doi.org/10.1109/CVPR.2009.5206547

  5. Elhamifar, E., Vidal, R.: Clustering disjoint subspaces via sparse representation. In: Proceedings of the 2010 International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Dallas, pp. 1926−1929. IEEE (2010). https://doi.org/10.1109/ICASSP.2010.5495317

  6. Liu, G.C., Yan, S.C.: Latent low-rank representation for subspace segmentation and feature extraction. In: Proceedings of the 2011 IEEE International Conference on Computer Vision (ICCV), Barcelona, pp. 1615−1622. IEEE (2011). https://doi.org/10.1109/ICCV.2011.6126422

  7. Wu, F., Yuan, P., Shi, G., Li, X., Dong, W., Wu, J.: Robust subspace clustering network with dual-domain regularization. Pattern Recogn. Lett. 149, 44–50 (2021). https://doi.org/10.1016/j.patrec.2021.06.009

    Article  Google Scholar 

  8. Guo, L., Zhang, X., Liu, Z., Xue, X., Wang, Q., Zheng, S.: Robust subspace clustering based on automatic weighted multiple kernel learning. Inf. Sci. 573, 453–474 (2021). https://doi.org/10.1016/J.INS.2021.05.070

    Article  MathSciNet  Google Scholar 

  9. Ma, L., Wang, C., Xiao, B., Zhou, W.: Sparse representation for face recognition based on discriminative low-rank dictionary learning. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2586–2593 (2012). https://doi.org/10.1109/CVPR.2012.6247977

  10. Tron, R., Vidal, R.: A benchmark for the comparison of 3-d motion segmentation algorithms. In: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1−8. IEEE, Minneapolis (2007). https://doi.org/10.1109/CVPR.2007.382974

  11. Wang, W., Li, X., Feng, X., Wang, S.: A survey on sparse subspace clustering. IEEE J. Autom. Sin. 41(8), 1373–1384 (2015). https://doi.org/10.16383/j.aas.2015.c140891

  12. Soltanolkotabi, M., Elhamifar, E., Candès, E.J.: Robust subspace clustering. Ann. Statist. 42(2), 669–699 (2014). https://doi.org/10.1214/13-AOS1199

    Article  MathSciNet  MATH  Google Scholar 

  13. Li, C.G., You, C., Vidal, R.: Structured sparse subspace clustering: a joint affinity learning and subspace clustering framework. IEEE Trans Image Process 26(6), 2988–3001 (2017). https://doi.org/10.1109/TIP.2017.2691557

    Article  MathSciNet  MATH  Google Scholar 

  14. You, C., Robinson, D., Vidal, R.: Scalable sparse subspace clustering by orthogonal matching pursuit. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3918–3927 (2016). https://doi.org/10.1109/CVPR.2016.425

Download references

Acknowledgments

Research on this work was partially supported by grants from and National Nature Science Foundation of China (No. 62166028).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Min Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Cite this paper

Zhu, K., Li, M. (2022). Sparse Subspace Clustering Based on Adaptive Parameter Training. In: Shi, Z., Zucker, JD., An, B. (eds) Intelligent Information Processing XI. IIP 2022. IFIP Advances in Information and Communication Technology, vol 643. Springer, Cham. https://doi.org/10.1007/978-3-031-03948-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-03948-5_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-03947-8

  • Online ISBN: 978-3-031-03948-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics