Unified Multi-View Orthonormal Non-Negative Graph Based Clustering
Framework
- URL: http://arxiv.org/abs/2211.02883v1
- Date: Thu, 3 Nov 2022 08:18:27 GMT
- Title: Unified Multi-View Orthonormal Non-Negative Graph Based Clustering
Framework
- Authors: Liangchen Liu, Qiuhong Ke, Chaojie Li, Feiping Nie, Yingying Zhu
- Abstract summary: We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework.
We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
- Score: 74.25493157757943
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Spectral clustering is an effective methodology for unsupervised learning.
Most traditional spectral clustering algorithms involve a separate two-step
procedure and apply the transformed new representations for the final
clustering results. Recently, much progress has been made to utilize the
non-negative feature property in real-world data and to jointly learn the
representation and clustering results. However, to our knowledge, no previous
work considers a unified model that incorporates the important multi-view
information with those properties, which severely limits the performance of
existing methods. In this paper, we formulate a novel clustering model, which
exploits the non-negative feature property and, more importantly, incorporates
the multi-view information into a unified joint learning framework: the unified
multi-view orthonormal non-negative graph based clustering framework
(Umv-ONGC). Then, we derive an effective three-stage iterative solution for the
proposed model and provide analytic solutions for the three sub-problems from
the three stages. We also explore, for the first time, the multi-model
non-negative graph-based approach to clustering data based on deep features.
Extensive experiments on three benchmark data sets demonstrate the
effectiveness of the proposed method.
Related papers
- A Novel Approach for Effective Multi-View Clustering with
Information-Theoretic Perspective [24.630259061774836]
This study presents a new approach called Sufficient Multi-View Clustering (SUMVC) that examines the multi-view clustering framework from an information-theoretic standpoint.
Firstly, we develop a simple and reliable multi-view clustering method SCMVC that employs variational analysis to generate consistent information.
Secondly, we propose a sufficient representation lower bound to enhance consistent information and minimise unnecessary information among views.
arXiv Detail & Related papers (2023-09-25T09:41:11Z) - 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) - Rethinking Clustering-Based Pseudo-Labeling for Unsupervised
Meta-Learning [146.11600461034746]
Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling.
This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data.
We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
arXiv Detail & Related papers (2022-09-27T19:04:36Z) - Multi-way Clustering and Discordance Analysis through Deep Collective
Matrix Tri-Factorization [9.283501363468728]
We advance the state-of-the-art in neural unsupervised learning to analyze Heterogeneous multi-typed, multimodal relational data.
We design the first neural method for collective matrix tri-factorization of arbitrary collections of matrices to perform spectral clustering of all constituent entities and learn cluster associations.
We illustrate its utility in quality assessment of knowledge bases and in improving representation learning.
arXiv Detail & Related papers (2021-09-27T16:24:23Z) - Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
We propose a novel framework for image clustering that incorporates joint representation learning and clustering.
Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
arXiv Detail & Related papers (2021-07-24T15:36:49Z) - 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.