Journal Home > Volume 28 , Issue 3

As a class of effective methods for incomplete multi-view clustering, graph-based algorithms have recently drawn wide attention. However, most of them could use further improvement regarding the following aspects. First, in some graph-based models, all views are forced to share a common similarity graph regardless of the severe consistency degeneration due to incomplete views. Next, similarity graph construction and cluster analysis are sometimes performed separately. Finally, the contribution difference of individual views is not always carefully considered. To address these issues simultaneously, this paper proposes an incomplete multi-view clustering algorithm based on auto-weighted fusion in partition space. In our algorithm, the information of cluster structure is introduced into the process of similarity learning to construct a desirable similarity graph, information fusion is performed in partition space to alleviate the negative impact brought about by consistency degradation, and all views are adaptively weighted to reflect their different contributions to clustering tasks. Finally, all the subtasks are collaboratively optimized in a united framework to reach an overall optimal result. Experimental results show that the proposed method compares favorably with the state-of-the-art methods.


menu
Abstract
Full text
Outline
About this article

Incomplete Multi-View Clustering via Auto-Weighted Fusion in Partition Space

Show Author's information Dongxue Xia1Yan Yang1( )Shuhong Yang2
School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu 611756, China
School of Computer, Guangxi University of Science and Technology, Liuzhou 545006, China

Abstract

As a class of effective methods for incomplete multi-view clustering, graph-based algorithms have recently drawn wide attention. However, most of them could use further improvement regarding the following aspects. First, in some graph-based models, all views are forced to share a common similarity graph regardless of the severe consistency degeneration due to incomplete views. Next, similarity graph construction and cluster analysis are sometimes performed separately. Finally, the contribution difference of individual views is not always carefully considered. To address these issues simultaneously, this paper proposes an incomplete multi-view clustering algorithm based on auto-weighted fusion in partition space. In our algorithm, the information of cluster structure is introduced into the process of similarity learning to construct a desirable similarity graph, information fusion is performed in partition space to alleviate the negative impact brought about by consistency degradation, and all views are adaptively weighted to reflect their different contributions to clustering tasks. Finally, all the subtasks are collaboratively optimized in a united framework to reach an overall optimal result. Experimental results show that the proposed method compares favorably with the state-of-the-art methods.

Keywords: collaborative optimization, Incomplete Multi-view Clustering (IMC), partition space, auto-weighted fusion

References(32)

[1]
A. Saxena, M. Prasad, A. Gupta, N. Bharill, O. P. Patel, A. Tiwari, M. J. Er, W. Ding, and C. T. Lin, A review of clustering techniques and developments, Neurocomputing, vol. 267, pp. 664–681, 2017.
[2]
H. Tang, X. Zhu, K. Chen, K. Jia, and C. L. P. Chen, Towards uncovering the intrinsic data structures for unsupervised domain adaptation using structurally regularized deep clustering, IEEE Trans. Pattern. Anal. Mach. Intell., vol. 44, no. 10, pp. 6517–6533, 2022.
[3]
Y. Yang and H. Wang, Multi-view clustering: A survey, Big Data Mining and Analytics, vol. 1, no. 2, pp. 83–107, 2018.
[4]
J. Hu, Y. Pan, T. Li, and Y. Yang, TW-Co-MFC: Two-level weighted collaborative fuzzy clustering based on maximum entropy for multi-view data, Tsinghua Science and Technology, vol. 26, no. 2, pp. 185–198, 2021.
[5]
Z. Lin, Z. Kang, L. Zhang, and L. Tian, Multi-view attributed graph clustering, IEEE Trans. Knowl. Data Eng., .
[6]
J. Ye and J. Guo, Anchors bring ease: An embarrassingly simple approach to partial multi-view clustering, in Proc. 33th National Conf. Artificial Intelligence and 31st Innovative Applications of Artificial Intelligence Conf. and Ninth AAAI Symp. Educational Advances in Artificial Intelligence, Honolulu, HI, USA, 2019, pp. 118–125.
[7]
J. Wen, Y. Xu, and H. Liu, Incomplete multiview spectral clustering with adaptive graph learning, IEEE Trans. Cybern., vol. 50, no. 4, pp. 1418–1429, 2020.
[8]
S. Y. Li, Y. Jiang, and Z. H. Zhou, Partial multi-view clustering, in Proc. 28th AAAI Conf. Artificial Intelligence, Québec, Canada, 2014, pp. 1968–1974.
[9]
M. Hu and S. Chen, Doubly aligned incomplete multi-view clustering, in Proc. 27th Int. Joint Conf. Artificial// Proceedings of the Intelligence, Stockholm, Sweden, 2018, pp. 2262–2268.
[10]
X. Liu, X. Zhu, M. Li, L. Wang, E. Zhu, T. Liu, M. Kloft, D. Shen, J. Yin, and W. Gao, Multiple kernel k-means with incomplete kernels, IEEE Trans. Pattern. Anal. Mach. Intell., vol. 42, no. 5, pp. 1191–1204, 2020.
[11]
X. Liu, M. Li, C. Tang, J. Xia, J. Xiong, L. Liu, M. Kloft, and E. Zhu, Efficient and effective regularized incomplete multi-view clustering, IEEE Trans. Pattern. Anal. Mach. Intell., vol. 43, no. 8, pp. 2634–2646, 2021.
[12]
H. Zhao, H. Liu, and Y. Fu, Incomplete multi-modal visual data grouping, in Proc. 25th Int. Joint Conf. Artificial Intelligence, New York, NY, USA, 2016, pp. 2392–2398.
[13]
S. Bhadra, S. Kaski, and J. Rousu, Multi-view kernel completion, Mach. Learn., vol. 106, no. 5, pp. 713–739, 2017.
[14]
H. Wang, L. Zong, B. Liu, Y. Yang, and W. Zhou, Spectral perturbation meets incomplete multi-view data, in Proc. 28th Int. Joint Conf. Artificial Intelligence, Macao, China, 2019, pp. 3677–3683.
[15]
W. Zhou, H. Wang, and Y. Yang, Consensus graph learning for incomplete multi-view clustering, in Proc. of the 23rd Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining, Macau, China, 2019, pp. 529–540.
[16]
J. Wen, Z. Zhang, Y. Xu, B. Zhang, L. Fei, and H. Liu, Unified embedding alignment with missing views inferring for incomplete multi-view clustering, in Proc. 33thAAAI Conf. Artificial Intelligence and 31st Innovative Applications of Artificial Intelligence Conf. and 9th AAAI Symp. Educational Advances in Artificial Intelligence, Honolulu, HI, USA, 2019, pp. 5393–5400.
[17]
W. Shao, L. He, and P. S. Yu, Multiple incomplete views clustering via weighted nonnegative matrix factorization with L2,1 regularization, in Proc. 2015th European Conf. Machine Learning and Knowledge Discovery in Databases, Porto, Portugal, 2015, pp. 318–334.
[18]
X. Zhu, X. Liu, M. Li, E. Zhu, L. Liu, Z. Cai, J. Yin, and W. Gao, Localized incomplete multiple kernel k-means, in Proc. 27th Int. Joint Conf. on Artificial Intelligence, Stockholm, Sweden, 2018, pp. 3271–3277.
[19]
Z. Kang, X. Zhao, C. Peng, H. Zhu, J. T. Zhou, X. Peng, W. Chen, and Z. Xu, Partition level multiview subspace clustering, Neural Netw., vol. 122, pp. 279–288, 2020.
[20]
A. Trivedi, P. Rai, H. Daum III, and S. L. DuVall, Multiview clustering with incomplete views, in Proc. Adv. in Neural Inform. Process. Syst., Cambridge, MA, USA, Œ2010, pp. 107–114.
[21]
W. Shao, X. Shi, and P. S. Yu, Clustering on multiple incomplete datasets via collective kernel learning, in Proc. of the 2013 IEEE 13th Int. Conf. Data Mining, Dallas, TX, USA, 2013, pp. 1181–1186.
[22]
H. Gao, F. Nie, X. Li, and H. Huang, Multi-view subspace clustering, in Proc. of the 2015 IEEE Int. Conf. Computer Vision, Santiago, Chile, 2015, pp. 4238–4246.
[23]
J. Huang, F. Nie, and H. Huang, A new simplex sparse learning model to measure data similarity for clustering, in Proc. 24th Int. Joint Conf. Artificial Intelligence, Buenos Aires, Argentina, 2015, pp. 3569–3575.
[24]
U. Von Luxburg, A tutorial on spectral clustering, Stat. Comput., vol. 17, no. 4, pp. 395–416, 2007.
[25]
A. Y. Ng, M. I. Jordan, and Y. Weiss, On spectral clustering: Analysis and an algorithm, in Proc. 14th Int. Conf. Neural Information Processing Systems: Natural and Synthetic, British Columbia, Canada, 2001, pp. 849–856.
[26]
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends® Mach. Learn., vol. 3, no. 1, pp. 1–122, 2011.
[27]
S. Huang, Z. Kang, I. W. Tsang, and Z. Xu, Auto-weighted multi-view clustering via kernelized graph learning, Pattern Recogn., vol. 88, pp. 174–184, 2019.
[28]
F. Nie, X. Wang, and H. Huang, Clustering and projected clustering with adaptive neighbors, in Proc. 20th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, New York, NY, USA, pp. 977–986, 2014.
[29]
C. D. Meyer, Matrix Analysis and Applied Linear Algebra. Philadelphia, PA, USA: SIAM, 2000.
DOI
[30]
X. Xu, S. Ding, and Z. Shi, An improved density peaks clustering algorithm with fast finding cluster centers, Knowl.-Based Syst., vol. 158, pp. 65–74, 2018.
[31]
X. Zhang, F. Sun, G. Liu, and Y. Ma, Fast low-rank subspace segmentation, IEEE Trans. Knowl. Data Eng., vol. 26, no. 5, pp. 1293–1297, 2014.
[32]
Z. Kang, Z. Lin, X. Zhu, and W. Xu, Structured graph learning for scalable subspace clustering: From single view to multiview, EEE Trans. Cybern., vol. 52, no. 9, pp. 8976–8986, 2022.
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 13 May 2022
Revised: 30 June 2022
Accepted: 01 July 2022
Published: 13 December 2022
Issue date: June 2023

Copyright

© The author(s) 2023.

Acknowledgements

This work was supported by the National Natural Science Foundation of China (No. 61976247) and the Basic Ability Promotion Project of Guangxi Middle-Aged and Young University Teachers (No. 2018KY0322)

Rights and permissions

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return