A Novel Robust Low-rank Multi-view Diversity Optimization Model with Adaptive-Weighting Based Manifold Learning. (February 2022)

• Record Type: Journal Article
• Authors: Tan, Junpeng; Yang, Zhijing; Ren, Jinchang; Wang, Bing; Cheng, Yongqiang; Ling, Wing-Kuen
• Is Part Of: Pattern recognition. Volume 122(2022)
• Publication Date: 2022-02
• Subjects: Low-rank Representation (LRR) -- Multi-view Subspace Clustering (MVSC) -- Hilbert Schmidt Independence Criterion (HSIC) -- Non-negative Matrix Factorization (NMF) -- Adaptive-Weighting Manifold Learning (AWML); Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2021.108298
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: We propose a novel multi-view clustering algorithm which features sparse low-rank subspace with the novel bilinear error matrices decomposition model based on non-negative matrix factorization (NMF) and adaptive-weighting manifold learning. For more robust decomposition of the noisy part of the data, the L 21 norm and the nuclear norm are used to constrain the error matrix of NMF and the error matrix of basis matrix, respectively. In order to preserve the geometric structure and relevant information of each view, adaptive-weighting manifold learning and the Hilbert Schmidt Independence Criterion are added to the model, which is solved by the idea of adaptive exponential weighting. The proposed algorithms have obtained very good experimental results in several well-known multi-view datasets, and it has a very fast convergence rate. Abstract: Multi-view clustering has become a hot yet challenging topic, due mainly to the independence of and information complementarity between different views. Although good results are achieved to a certain extent from typical methods including multi-view based k -means clustering, sparse cooperative representation clustering and subspace clustering, they still suffer from several drawbacks or limitations: (1) When each view is sparse decomposed, it still contains some hidden information for mining, such as the structure of samples, the intra-class similarity measure, and the inter-class diversity discrimination, etc. (2) Most of the existing multi-view methods only consider the local features within each view, but fail to effectively balance the importance of and combine information among different views in a diversified way. To tackle these issues, we propose a novel multi-view diversity learning model based on robust bilinear error decomposition (BED). The BED term with a low rank sparse constraint is an improved non-negative matrix factorization (NMF), which is used to extract the hidden structure information in sparse decomposition and useful diversity discrimination information in error matrix. The preservation of local features and selection of important views are achieved by adaptive weighted manifold learning. Furthermore, the Hilbert Schmidt independence criterion is used as a diversity learning term for mutual learning and fusion among views. Finally, the proposed robust low-rank multi-view diversity learning spectral clustering method is evaluated and benchmarked with eight state-of-the-art methods. Experiments in six real datasets have fully validated the significantly improved accuracy and efficiency of the proposed methodology for effective clustering of multi-view images.