Joint Multi-View Collaborative Clustering
- URL: http://arxiv.org/abs/2311.12859v1
- Date: Wed, 25 Oct 2023 08:23:45 GMT
- Title: Joint Multi-View Collaborative Clustering
- Authors: Yasser Khalafaoui (Alteca, ETIS), Basarab Matei (LIPN), Nistor Grozavu
(ETIS), Martino Lovisetto (Alteca)
- Abstract summary: Multi-view data provide richer information than traditional single-view data.
The goal of multi-view clustering algorithms is to discover the common latent structure shared by multiple views.
We propose the Joint Multi-View Collaborative Clustering (JMVCC) solution.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Data is increasingly being collected from multiple sources and described by
multiple views. These multi-view data provide richer information than
traditional single-view data. Fusing the former for specific tasks is an
essential component of multi-view clustering. Since the goal of multi-view
clustering algorithms is to discover the common latent structure shared by
multiple views, the majority of proposed solutions overlook the advantages of
incorporating knowledge derived from horizontal collaboration between
multi-view data and the final consensus. To fill this gap, we propose the Joint
Multi-View Collaborative Clustering (JMVCC) solution, which involves the
generation of basic partitions using Non-negative Matrix Factorization (NMF)
and the horizontal collaboration principle, followed by the fusion of these
local partitions using ensemble clustering. Furthermore, we propose a weighting
method to reduce the risk of negative collaboration (i.e., views with low
quality) during the generation and fusion of local partitions. The experimental
results, which were obtained using a variety of data sets, demonstrate that
JMVCC outperforms other multi-view clustering algorithms and is robust to noisy
views.
Related papers
- Anchor-based Multi-view Subspace Clustering with Hierarchical Feature Descent [46.86939432189035]
We propose Anchor-based Multi-view Subspace Clustering with Hierarchical Feature Descent.
Our proposed model consistently outperforms the state-of-the-art techniques.
arXiv Detail & Related papers (2023-10-11T03:29:13Z) - 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) - Adaptively-weighted Integral Space for Fast Multiview Clustering [54.177846260063966]
We propose an Adaptively-weighted Integral Space for Fast Multiview Clustering (AIMC) with nearly linear complexity.
Specifically, view generation models are designed to reconstruct the view observations from the latent integral space.
Experiments conducted on several realworld datasets confirm the superiority of the proposed AIMC method.
arXiv Detail & Related papers (2022-08-25T05:47:39Z) - Fast Multi-view Clustering via Ensembles: Towards Scalability,
Superiority, and Simplicity [63.85428043085567]
We propose a fast multi-view clustering via ensembles (FastMICE) approach.
The concept of random view groups is presented to capture the versatile view-wise relationships.
FastMICE has almost linear time and space complexity, and is free of dataset-specific tuning.
arXiv Detail & Related papers (2022-03-22T09:51:24Z) - Locality Relationship Constrained Multi-view Clustering Framework [5.586948325488168]
Locality Relationship Constrained Multi-view Clustering Framework (LRC-MCF) is presented.
It aims to explore the diversity, geometric, consensus and complementary information among different views.
LRC-MCF takes sufficient consideration to weights of different views in finding the common-view locality structure.
arXiv Detail & Related papers (2021-07-11T15:45:10Z) - Multi-view Hierarchical Clustering [12.01031088378791]
Multi-view clustering aims to promote clustering results with multi-view data.
We propose a Multi-view Hierarchical Clustering (MHC), which partitions multi-view data at multiple levels of granularity.
MHC can be easily and effectively employed in real-world applications without parameter selection.
arXiv Detail & Related papers (2020-10-15T07:46:18Z) - 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) - Deep Embedded Multi-view Clustering with Collaborative Training [42.289184796907655]
Multi-view clustering has attracted increasing attentions recently by utilizing information from multiple views.
Existing multi-view clustering methods are either with high computation and space complexities, or lack of representation capability.
We propose deep embedded multi-view clustering with collaborative training (DEMVC) in this paper.
arXiv Detail & Related papers (2020-07-26T06:51:57Z) - Generative Partial Multi-View Clustering [133.36721417531734]
We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem.
First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views.
Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
arXiv Detail & Related papers (2020-03-29T17:48:27Z)
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.