Deep Incomplete Multi-View Multiple Clusterings

• URL: http://arxiv.org/abs/2010.02024v1
• Date: Fri, 2 Oct 2020 08:01:24 GMT
• Title: Deep Incomplete Multi-View Multiple Clusterings
• Authors: Shaowei Wei, Jun Wang, Guoxian Yu, Carlotta Domeniconi, Xiangliang Zhang
• Abstract summary: We introduce a deep incomplete multi-view multiple clusterings framework, which achieves the completion of data view and multiple shared representations simultaneously. Experiments on benchmark datasets confirm that DiMVMC outperforms the state-of-the-art competitors in generating multiple clusterings with high diversity and quality.
• Score: 41.43164409639238
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-view clustering aims at exploiting information from multiple heterogeneous views to promote clustering. Most previous works search for only one optimal clustering based on the predefined clustering criterion, but devising such a criterion that captures what users need is difficult. Due to the multiplicity of multi-view data, we can have meaningful alternative clusterings. In addition, the incomplete multi-view data problem is ubiquitous in real world but has not been studied for multiple clusterings. To address these issues, we introduce a deep incomplete multi-view multiple clusterings (DiMVMC) framework, which achieves the completion of data view and multiple shared representations simultaneously by optimizing multiple groups of decoder deep networks. In addition, it minimizes a redundancy term to simultaneously %uses Hilbert-Schmidt Independence Criterion (HSIC) to control the diversity among these representations and among parameters of different networks. Next, it generates an individual clustering from each of these shared representations. Experiments on benchmark datasets confirm that DiMVMC outperforms the state-of-the-art competitors in generating multiple clusterings with high diversity and quality.

Related papers

• Federated Incomplete Multi-View Clustering with Heterogeneous Graph Neural Networks [21.710283538891968]
  Federated multi-view clustering offers the potential to develop a global clustering model using data distributed across multiple devices. Current methods face challenges due to the absence of label information and the paramount importance of data privacy. We introduce a federated incomplete multi-view clustering framework with heterogeneous graph neural networks (FIM-GNNs)
  arXiv  Detail & Related papers  (2024-06-12T07:16:00Z)
• CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
  We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net) It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
  arXiv  Detail & Related papers  (2024-03-28T15:45:03Z)
• Federated Deep Multi-View Clustering with Global Self-Supervision [51.639891178519136]
  Federated multi-view clustering has the potential to learn a global clustering model from data distributed across multiple devices. In this setting, label information is unknown and data privacy must be preserved. We propose a novel federated deep multi-view clustering method that can mine complementary cluster structures from multiple clients.
  arXiv  Detail & Related papers  (2023-09-24T17:07:01Z)
• 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)
• Deep Multi-View Semi-Supervised Clustering with Sample Pairwise Constraints [10.226754903113164]
  We propose a novel Deep Multi-view Semi-supervised Clustering (DMSC) method, which jointly optimize three kinds of losses during networks finetuning. We demonstrate that our proposed approach performs better than the state-of-the-art multi-view and single-view competitors.
  arXiv  Detail & Related papers  (2022-06-10T08:51:56Z)
• 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)
• 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)
• Joint Featurewise Weighting and Lobal Structure Learning for Multi-view Subspace Clustering [3.093890460224435]
  Multi-view clustering integrates multiple feature sets, which reveal distinct aspects of the data and provide complementary information to each other. Most existing multi-view clustering methods only aim to explore the consistency of all views while ignoring the local structure of each view. We propose a novel multi-view subspace clustering method via simultaneously assigning weights for different features and capturing local information of data in view-specific self-representation feature spaces.
  arXiv  Detail & Related papers  (2020-07-25T01:57:57Z)

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.