Multi-view Clustering via Deep Matrix Factorization and Partition Alignment

• URL: http://arxiv.org/abs/2105.00277v1
• Date: Sat, 1 May 2021 15:06:57 GMT
• Title: Multi-view Clustering via Deep Matrix Factorization and Partition Alignment
• Authors: Chen Zhang, Siwei Wang, Jiyuan Liu, Sihang Zhou, Pei Zhang, Xinwang Liu, En Zhu, Changwang Zhang
• Abstract summary: We propose a novel multi-view clustering algorithm via deep matrix decomposition and partition alignment. An alternating optimization algorithm is developed to solve the optimization problem with proven convergence.
• Score: 43.56334737599984
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-view clustering (MVC) has been extensively studied to collect multiple source information in recent years. One typical type of MVC methods is based on matrix factorization to effectively perform dimension reduction and clustering. However, the existing approaches can be further improved with following considerations: i) The current one-layer matrix factorization framework cannot fully exploit the useful data representations. ii) Most algorithms only focus on the shared information while ignore the view-specific structure leading to suboptimal solutions. iii) The partition level information has not been utilized in existing work. To solve the above issues, we propose a novel multi-view clustering algorithm via deep matrix decomposition and partition alignment. To be specific, the partition representations of each view are obtained through deep matrix decomposition, and then are jointly utilized with the optimal partition representation for fusing multi-view information. Finally, an alternating optimization algorithm is developed to solve the optimization problem with proven convergence. The comprehensive experimental results conducted on six benchmark multi-view datasets clearly demonstrates the effectiveness of the proposed algorithm against the SOTA methods.

Related papers

• Enhanced Latent Multi-view Subspace Clustering [25.343388834470247]
  We propose an Enhanced Latent Multi-view Subspace Clustering (ELMSC) method for recovering latent space representation. Our proposed ELMSC is able to achieve higher clustering performance than some state-of-art multi-view clustering methods.
  arXiv  Detail & Related papers  (2023-12-22T15:28:55Z)
• One-step Multi-view Clustering with Diverse Representation [47.41455937479201]
  We propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework. We develop an efficient optimization algorithm with proven convergence to solve the resultant problem.
  arXiv  Detail & Related papers  (2023-06-08T02:52:24Z)
• Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
  We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF) Our model directly considers the between-view relationship and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
  arXiv  Detail & Related papers  (2023-03-29T14:54:19Z)
• Late Fusion Multi-view Clustering via Global and Local Alignment Maximization [61.89218392703043]
  Multi-view clustering (MVC) optimally integrates complementary information from different views to improve clustering performance. Most of existing approaches directly fuse multiple pre-specified similarities to learn an optimal similarity matrix for clustering. We propose late fusion MVC via alignment to address these issues.
  arXiv  Detail & Related papers  (2022-08-02T01:49:31Z)
• Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinement [37.34296330445708]
  Multi-view clustering is an important yet challenging task in machine learning and data mining. We propose a novel Multi-View Clustering method with Deep semi-NMF and Global Graph Refinement (MVC-DMF-GGR) in this paper.
  arXiv  Detail & Related papers  (2021-05-01T13:40:20Z)
• Discriminatively Constrained Semi-supervised Multi-view Nonnegative Matrix Factorization with Graph Regularization [10.978930376656423]
  We propose a novel Discriminatively Constrained Semi-Supervised Multi-View Nonnegative Matrix Factorization (DCS2MVNMF) Specifically, a discriminative weighting matrix is introduced for the auxiliary matrix of each view, which enhances the inter-class distinction. In addition, we design a new feature scale normalization strategy to align the multiple views and complete the corresponding iterative optimization schemes.
  arXiv  Detail & Related papers  (2020-10-26T02:58:11Z)
• Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix [57.11971786407279]
  Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data. This paper proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix. Our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base.
  arXiv  Detail & Related papers  (2020-08-31T12:28:40Z)
• Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from Cross View and Each View [68.88732535086338]
  This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization. Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
  arXiv  Detail & Related papers  (2020-08-23T08:25:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.