C$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection

• URL: http://arxiv.org/abs/2208.09736v1
• Date: Sat, 20 Aug 2022 19:39:17 GMT
• Title: C$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection
• Authors: Yanyong Huang, Zongxin Shen, Yuxin Cai, Xiuwen Yi, Dongjie Wang, Fengmao Lv and Tianrui Li
• Abstract summary: Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of unlabeled data. We propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C$2$IMUFS) to address the aforementioned issues. C$2$IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse $ell_2,p$-norm.
• Score: 12.340714611533418
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. However, multi-view data are usually incomplete, i.e., a part of instances are presented on some views but not all views. Besides, learning the complete similarity graph, as an important promising technology in existing MUFS methods, cannot achieve due to the missing views. In this paper, we propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C$^{2}$IMUFS) to address the aforementioned issues. Concretely, C$^{2}$IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse $\ell_{2,p}$-norm, which can offer better adaptability and flexibility. By the sparse linear combinations of multiple similarity matrices derived from different views, a complementary learning-guided similarity matrix reconstruction model is presented to obtain the complete similarity graph in each view. Furthermore, C$^{2}$IMUFS learns a consensus clustering indicator matrix across different views and embeds it into a spectral graph term to preserve the local geometric structure. Comprehensive experimental results on real-world datasets demonstrate the effectiveness of C$^{2}$IMUFS compared with state-of-the-art methods.

Related papers

• Multi-view Fuzzy Representation Learning with Rules based Model [25.997490574254172]
  Unsupervised multi-view representation learning has been extensively studied for mining multi-view data. This paper proposes a new multi-view fuzzy representation learning method based on the interpretable Takagi-Sugeno-Kang fuzzy system (MVRL_FS)
  arXiv  Detail & Related papers  (2023-09-20T17:13:15Z)
• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• Latent Heterogeneous Graph Network for Incomplete Multi-View Learning [57.49776938934186]
  We propose a novel Latent Heterogeneous Graph Network (LHGN) for incomplete multi-view learning. By learning a unified latent representation, a trade-off between consistency and complementarity among different views is implicitly realized. To avoid any inconsistencies between training and test phase, a transductive learning technique is applied based on graph learning for classification tasks.
  arXiv  Detail & Related papers  (2022-08-29T15:14:21Z)
• MORI-RAN: Multi-view Robust Representation Learning via Hybrid Contrastive Fusion [4.36488705757229]
  Multi-view representation learning is essential for many multi-view tasks, such as clustering and classification. We propose a hybrid contrastive fusion algorithm to extract robust view-common representation from unlabeled data. Experimental results demonstrated that the proposed method outperforms 12 competitive multi-view methods on four real-world datasets.
  arXiv  Detail & Related papers  (2022-08-26T09:58:37Z)
• Localized Sparse Incomplete Multi-view Clustering [22.009806900278786]
  This paper proposes a simple but effective method, named localized sparse incomplete multi-view clustering (LSIMVC) To tackle these problems, this paper proposes a simple but effective method, named localized sparse incomplete multi-view clustering (LSIMVC)
  arXiv  Detail & Related papers  (2022-08-05T05:48:28Z)
• Incremental Unsupervised Feature Selection for Dynamic Incomplete Multi-view Data [16.48538951608735]
  In real applications, the multi-view data are often incomplete, i.e., some views of instances are missing. We propose an Incremental Incomplete Multi-view Unsupervised Feature Selection method (I$2$MUFS) on incomplete multi-view streaming data.
  arXiv  Detail & Related papers  (2022-04-05T16:29:39Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• V3H: View Variation and View Heredity for Incomplete Multi-view Clustering [65.29597317608844]
  Incomplete multi-view clustering is an effective method to integrate these incomplete views. We propose a novel View Variation and View Heredity approach (V3H) to overcome this limitation. V3H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multi-view data.
  arXiv  Detail & Related papers  (2020-11-23T03:24:48Z)
• Uncorrelated Semi-paired Subspace Learning [7.20500993803316]
  We propose a generalized uncorrelated multi-view subspace learning framework. To showcase the flexibility of the framework, we instantiate five new semi-paired models for both unsupervised and semi-supervised learning. Our proposed models perform competitively to or better than the baselines.
  arXiv  Detail & Related papers  (2020-11-22T22:14:20Z)
• Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistency [65.76554214664101]
  Graph learning has emerged as a promising technique for multi-view clustering with its ability to learn a unified and robust graph from multiple views. We propose a new multi-view graph learning framework, which for the first time simultaneously models multi-view consistency and multi-view inconsistency in a unified objective function. Experiments on twelve multi-view datasets have demonstrated the robustness and efficiency of the proposed approach.
  arXiv  Detail & Related papers  (2020-08-24T06:11:29Z)
• 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.