Structure-aware Hybrid-order Similarity Learning for Multi-view Unsupervised Feature Selection

• URL: http://arxiv.org/abs/2511.22656v1
• Date: Thu, 27 Nov 2025 17:46:06 GMT
• Title: Structure-aware Hybrid-order Similarity Learning for Multi-view Unsupervised Feature Selection
• Authors: Lin Xu, Ke Li, Dongjie Wang, Fengmao Lv, Tianrui Li, Yanyong Huang,
• Abstract summary: We propose Structure-aware Hybrid-order sImilarity learNing for multi-viEw unsupervised feature selection (SHINE-FS)<n>SHINE-FS first learns consensus anchors and the corresponding anchor graph to capture the cross-view relationships between the anchors and the samples.<n>It generates low-dimensional representations of the samples, which facilitate the reconstruction of multi-view data by identifying discriminative features.
• Score: 28.926101310373383
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-view unsupervised feature selection (MUFS) has recently emerged as an effective dimensionality reduction method for unlabeled multi-view data. However, most existing methods mainly use first-order similarity graphs to preserve local structure, often overlooking the global structure that can be captured by second-order similarity. In addition, a few MUFS methods leverage predefined second-order similarity graphs, making them vulnerable to noise and outliers and resulting in suboptimal feature selection performance. In this paper, we propose a novel MUFS method, termed Structure-aware Hybrid-order sImilarity learNing for multi-viEw unsupervised Feature Selection (SHINE-FS), to address the aforementioned problem. SHINE-FS first learns consensus anchors and the corresponding anchor graph to capture the cross-view relationships between the anchors and the samples. Based on the acquired cross-view consensus information, it generates low-dimensional representations of the samples, which facilitate the reconstruction of multi-view data by identifying discriminative features. Subsequently, it employs the anchor-sample relationships to learn a second-order similarity graph. Furthermore, by jointly learning first-order and second-order similarity graphs, SHINE-FS constructs a hybrid-order similarity graph that captures both local and global structures, thereby revealing the intrinsic data structure to enhance feature selection. Comprehensive experimental results on real multi-view datasets show that SHINE-FS outperforms the state-of-the-art methods.

Related papers

• Kernel Alignment-based Multi-view Unsupervised Feature Selection with Sample-level Adaptive Graph Learning [23.32756750343138]
  We propose a Kernel Alignment-based multi-view unsupervised FeatUre selection with Sample-level adaptive graph lEarning method (KAFUSE) to address these issues.<n>Experiments on real multi-view datasets demonstrate the superiority of KAFUSE over state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-01-12T07:50:51Z)
• Hierarchical Identity Learning for Unsupervised Visible-Infrared Person Re-Identification [81.3063589622217]
  Unsupervised visible-infrared person re-identification (USVI-ReID) aims to learn modality-invariant image features from unlabeled cross-modal person datasets.
  arXiv  Detail & Related papers  (2025-09-15T05:10:43Z)
• Global Graph Propagation with Hierarchical Information Transfer for Incomplete Contrastive Multi-view Clustering [12.080981190754986]
  We propose a novel incomplete multi-view clustering method with hierarchical information transfer.<n>Our method combines view-specific representation learning, global graph propagation with hierarchical information transfer, and contrastive clustering for joint optimization.
  arXiv  Detail & Related papers  (2025-02-26T16:50:08Z)
• One for all: A novel Dual-space Co-training baseline for Large-scale Multi-View Clustering [42.92751228313385]
  We propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC) The main objective of our approach is to enhance the clustering performance by leveraging co-training in two distinct spaces. Our algorithm has an approximate linear computational complexity, which guarantees its successful application on large-scale datasets.
  arXiv  Detail & Related papers  (2024-01-28T16:30:13Z)
• DealMVC: Dual Contrastive Calibration for Multi-view Clustering [78.54355167448614]
  We propose a novel Dual contrastive calibration network for Multi-View Clustering (DealMVC) We first design a fusion mechanism to obtain a global cross-view feature. Then, a global contrastive calibration loss is proposed by aligning the view feature similarity graph and the high-confidence pseudo-label graph. During the training procedure, the interacted cross-view feature is jointly optimized at both local and global levels.
  arXiv  Detail & Related papers  (2023-08-17T14:14:28Z)
• C$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection [12.340714611533418]
  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.
  arXiv  Detail & Related papers  (2022-08-20T19:39:17Z)
• Joint Multi-view Unsupervised Feature Selection and Graph Learning [18.303477722460247]
  This paper presents a joint multi-view unsupervised feature selection and graph learning (JMVFG) approach. We formulate the multi-view feature selection with decomposition, where each target matrix is decomposed into a view-specific basis matrix. Experiments on a variety of real-world multi-view datasets demonstrate the superiority of our approach for both the multi-view feature selection and graph learning tasks.
  arXiv  Detail & Related papers  (2022-04-18T10:50:03Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• 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)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• 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.