Skip to main content
SpringerLink
Log in

Multi-view subspace clustering using drop out technique on points

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Multi-view subspace clustering methods have been very popular among all the multi-view clustering approaches. Overall, in the subspace clustering methods, self-expressive representation of data points gives a coefficient matrix. In multi-view approaches coefficient matrices of all views are utilized to achieve one coefficient matrix that gives a clustering of points. In the previous proposed methods, to determine clusters, the focus was often on the sparsity among different clusters. However, the sparsity may cause that data points of the same clusters does not have strong connections, i.e. some points in the same cluster may not be connected that causes a cluster to be a union of two components and it causes the increase of over-segmentation. To address this problem, we apply drop out technique on columns for all views for several times. In each step, some columns are dropped out and just the remaining points have role in the self-representative combinations of points. Then we consider all self-expressive representations, simultaneously. This method improves the intra-clusters connectivity as well as some other criteria. Our method is evaluated on some real world multi-views data set for confirming its performance. The results depict that the method works well and the proposed algorithm has excellent connectivity. Moreover, some other criteria, which have been improved, are compared with some other contemporary approaches.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Data availability

Data that are used in this study are available at http://archive.ics.uci.edu/ml/datasets.html and http://www.vision.caltech.edu/ImageDatasets/Caltech101. The codes would be available by emailing to the corresponding author.

Notes

  1. http://archive.ics.uci.edu/ml/datasets.html.

  2. http://archive.ics.uci.edu/ml/datasets.html.

  3. http://archive.ics.uci.edu/ml/datasets.html.

  4. http://archive.ics.uci.edu/ml/datasets.html.

  5. http://vision.caltech.edu/ImageDatasets/Caltech101/.

References

  1. Liu X, Zhu X, Li M, Wang L, Zhu E, Liu T, Kloft M, Shen D, Yin J, Gao W (2019) Multiple kernel \(k\) k-means with incomplete kernels. IEEE Trans Pattern Anal Mach Intell 42(5):1191–1204

    Google Scholar 

  2. Tzortzis G, Likas A (2012) Kernel-based weighted multi-view clustering. In: 2012 IEEE 12th International Conference on Data Mining, pp. 675–684. IEEE

  3. Wang Y, Zhang W, Wu L, Lin X, Fang M, Pan S (2016) Iterative views agreement: An iterative low-rank based structured optimization method to multi-view spectral clustering. arXiv preprint arXiv:1608.05560

  4. Kang Z, Shi G, Huang S, Chen W, Pu X, Zhou JT, Xu Z (2020) Multi-graph fusion for multi-view spectral clustering. Knowl-Based Syst 189:105102

    Article  Google Scholar 

  5. Guo Y (2013) Convex subspace representation learning from multi-view data. In Proceedings of the AAAI Conference on Artificial Intelligence,  vol 27(1), pp 387–393

    Article  Google Scholar 

  6. Cao X, Zhang C, Fu H, Liu S, Zhang H (2015) Diversity-induced multi-view subspace clustering. Proceedings of the IEEE conference on computer vision and pattern recognition, 586–594

  7. Kang Z, Zhao X, Peng C, Zhu H, Zhou JT, Peng X, Chen W, Xu Z (2020) Partition level multiview subspace clustering. Neural Netw 122:279–288

    Article  Google Scholar 

  8. Zhang C, Hu Q, Fu H, Zhu P, Cao X (2017) Latent multi-view subspace clustering. Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4279–4287

  9. Gao H, Nie F, Li X, Huang H (2015) Multi-view subspace clustering. Proceedings of the IEEE international conference on computer vision, pp 4238–4246

  10. Tang C, Sun K, Tang C, Zheng X, Liu X, Huang J-J, Zhang W (2023) Multi-view subspace clustering via adaptive graph learning and late fusion alignment. Neural Netw 165:333–343

    Article  Google Scholar 

  11. Liu S, Wang S, Zhang P, Xu K, Liu X, Zhang C, Gao F (2022) Efficient one-pass multi-view subspace clustering with consensus anchors. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 7576–7584

  12. Kang Z, Lin Z, Zhu X, Xu W (2022) Structured graph learning for scalable subspace clustering: from single view to multiview. IEEE Transact Cybern 52(9):8976–8986

    Article  Google Scholar 

  13. Si X, Yin Q, Zhao X, Yao L (2022) Consistent and diverse multi-view subspace clustering with structure constraint. Pattern Recogn 121:108196

    Article  Google Scholar 

  14. Cai X, Huang D, Zhang G-Y, Wang C-D (2023) Seeking commonness and inconsistencies: a jointly smoothed approach to multi-view subspace clustering. Inform Fusion 91:364–375

    Article  Google Scholar 

  15. Lv J, Kang Z, Wang B, Ji L, Xu Z (2021) Multi-view subspace clustering via partition fusion. Inf Sci 560:410–423

    Article  MathSciNet  Google Scholar 

  16. Brbić M, Kopriva I (2018) Multi-view low-rank sparse subspace clustering. Pattern Recogn 73:247–258

    Article  Google Scholar 

  17. Chen J, Yang S, Mao H, Fahy C (2021) Multiview subspace clustering using low-rank representation. IEEE Transact Cybern 52(11):12364–12378

    Article  Google Scholar 

  18. Khan GA, Hu J, Li T, Diallo B, Zhao Y (2022) Multi-view low rank sparse representation method for three-way clustering. Int J Mach Learn Cybern 13:233–253

    Article  Google Scholar 

  19. Zhao J, Qiu Z, Sun S (2022) Multi-view multi-label active learning with conditional Bernoulli mixtures. Int J Mach Learn Cybern 1–13

  20. Nasihatkon B, Hartley R (2011) Graph connectivity in sparse subspace clustering. CVPR 2011:2137–2144

    Google Scholar 

  21. Yang Y, Feng J, Jojic N, Yang J, Huang TS (2016) \(\ell ^0\)-sparse subspace clustering. European conference on computer vision, pp 731–747

  22. Chen Y, Li C-G, You C (2020) Stochastic sparse subspace clustering. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp 4155–4164

  23. Elhamifar E, Vidal R (2009) Sparse subspace clustering. IEEE Conference on Computer Vision and Pattern Recognition, pp 2790–279

  24. You C, Robinson D, Vidal R (2016) Scalable sparse subspace clustering by orthogonal matching pursuit. Proceedings of the IEEE conference on computer vision and pattern recognition, pp 3918–3927

  25. Pati Y, Rezaiifar R, Krishnaprasad P (1993) Orthogonal matching pursuit: recursive function approximation with application to wavelet decomposition. Proceedings of 27th Asilomar conference on signals, systems and computers, 342–465

  26. Davenport MA, Wakin MB (2010) Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans Inf Theory 56(9):4395–4401

    Article  MathSciNet  Google Scholar 

  27. Lu C-Y, Min H, Zhao Z-Q, Zhu L, Huang D-S, Yan S (2012) Robust and efficient subspace segmentation via least squares regression. In: Computer Vision–ECCV 2012: 12th European Conference on Computer Vision, Florence, Italy, October 7-13, 2012, Proceedings, Part VII 12, pp. 347–360

  28. Srivastava N, Hinton G, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929–1958

    MathSciNet  Google Scholar 

  29. Wager S, Wang S, Liang PS (2013) Dropout training as adaptive regularization. Adv Neural Inform Proces Syst 26

  30. Gal Y, Ghahramani Z (2016) Dropout as a bayesian approximation: Representing model uncertainty in deep learning. International conference on machine learning, 1050–1059. PMLR

  31. Baldi P, Sadowski PJ (2013) Understanding dropout. Adv Neural Inform Proces Syst 26

  32. Zhuge W, Hou C, Jiao Y, Yue J, Tao H, Yi D (2017) Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. PLoS ONE 12(5):0176769

    Article  Google Scholar 

  33. Abavisani M, Patel VM (2018) Multimodal sparse and low-rank subspace clustering. Inform Fusion 39:168–177

    Article  Google Scholar 

  34. Nie F, Li J, Li X et al (2016) Parameter-free auto-weighted multiple graph learning: a framework for multiview clustering and semi-supervised classification. IJCAI 9:1881–1887

    Google Scholar 

  35. Kang Z, Zhou W, Zhao Z, Shao J, Han M, Xu Z (2020) Large-scale multi-view subspace clustering in linear time. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 4412–4419

  36. Tao Z, Liu H, Li S, Ding Z, Fu Y (2017) From ensemble clustering to multi-view clustering. Proceedings of the 26th International Joint Conference on Artificial Intelligence, 2843–2849

  37. Cai D, He X, Han J (2005) Document clustering using locality preserving indexing. IEEE Trans Knowl Data Eng 17(12):1624–1637

    Article  Google Scholar 

  38. Hubert L, Arabie P (1985) Comparing partitions. J Classification 2:193–218

    Article  Google Scholar 

  39. Mohar B, Alavi Y, Chartrand G, Oellermann O (1991) The Laplacian spectrum of graphs. Graph Theory Combinatorics Appl 2(12):871–898

    MathSciNet  Google Scholar 

  40. Vidal R, Favaro P (2014) Low rank subspace clustering (lrsc). Pattern Recogn Lett 43:47–61

    Article  Google Scholar 

  41. Lee K-C, Ho J, Kriegman DJ (2005) Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans Pattern Anal Mach Intell 27(5):684–698

    Article  Google Scholar 

  42. LeCun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proc IEEE 86(11):2278–2324

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Graduate University of Advanced Technology, Kerman, Iran

    Fatemeh Sadjadi & Mina Jamshidi

  2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, China

    Zhao Kang

Authors
  1. Fatemeh Sadjadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mina Jamshidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhao Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mina Jamshidi.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

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

Sadjadi, F., Jamshidi, M. & Kang, Z. Multi-view subspace clustering using drop out technique on points. Int. J. Mach. Learn. & Cyber. 15, 1841–1854 (2024). https://doi.org/10.1007/s13042-023-02001-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-023-02001-6

Keywords

Search

Navigation