Cross-View Representation Learning-Based Deep Multiview Clustering With Adaptive Graph Constraint
- 4 September 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (7) , 12895-12909
Abstract
Deep multiview clustering provides an efficient way to analyze the data consisting of multiple modalities and features. Recently, the autoencoder (AE)-based deep multiview clustering algorithms have attracted intensive attention by virtue of their rewarding capabilities of extracting inherent features. Nevertheless, most existing methods are still confronted by several problems. First, the multiview data usually contains abundant cross-view information, thus parallel performing an individual AE for each view and directly combining the extracted latent together can hardly construct an informative view-consensus feature space for clustering. Second, the intrinsic local structures of multiview data are complicated, hence simply embedding a preset graph constraint into multiview clustering models cannot guarantee expected performance. Third, current methods commonly utilize the Kullback-Leibler (KL) divergence as clustering loss and accordingly may yield appalling clusters that lack discriminate characters. To solve these issues, in this article we propose two new AE-based deep multiview clustering algorithms named AE-based deep multiview clustering model incorporating graph embedding (AG-DMC) and deep discriminative multiview clustering algorithm with adaptive graph constraint (ADG-DMC). In AG-DMC, a novel cross-view representation learning model is established delicately by performing decoding processes based on the cascaded view-specific latent to learn sound view-consensus features for inspiring clustering results. In addition, an entropy-regularized adaptive graph constraint is imposed on the obtained soft assignments of data to precisely preserve potential local structures. Furthermore, in the improved model ADG-DMC, the adversarial learning mechanism is adopted as clustering loss to strengthen the discrimination of different clusters for better performance. In the comprehensive experiments carried out on eight real-world datasets, the proposed algorithms have achieved superior performance in the comparison with other advanced multiview clustering algorithms.Keywords
Funding Information
- National Natural Science Foundation of China (62273164)
- Natural Science Foundation of Guangdong Province (2021A1515011998)
- Science and technology project of Guangzhou (202102020634)
- Science and Technology Development Fund, Macao SAR (0046/2023/RIA1)
- University of Macau and the University of Macau Development Foundation (MYRG-GRG2023-00106-FST-UMDF)
This publication has 40 references indexed in Scilit:
- DCCNMF: Deep Complementary and Consensus Non-negative Matrix Factorization for multi-view clusteringKnowledge-Based Systems, 2023
- High-order multi-view clustering for generic dataInformation Fusion, 2023
- Unsupervised feature selection via multiple graph fusion and feature weight learningScience China Information Sciences, 2023
- Pixel and region level information fusion in membership regularized fuzzy clustering for image segmentationInformation Fusion, 2022
- An evolutionary many-objective approach to multiview clustering using feature and relational dataApplied Soft Computing, 2021
- Deep embedded multi-view clustering with collaborative trainingInformation Sciences, 2021
- Multi-view clustering via deep concept factorizationKnowledge-Based Systems, 2021
- Multi-view spectral clustering via integrating nonnegative embedding and spectral embeddingInformation Fusion, 2020
- Random Feature Map-Based Multiple Kernel Fuzzy Clustering with All Feature WeightsInternational Journal of Fuzzy Systems, 2019
- Semi-supervised deep embedded clusteringNeurocomputing, 2019