Graph Random Walk with Feature-Label Space Alignment: A Multi-Label Feature Selection Method

• URL: http://arxiv.org/abs/2505.23228v1
• Date: Thu, 29 May 2025 08:28:02 GMT
• Title: Graph Random Walk with Feature-Label Space Alignment: A Multi-Label Feature Selection Method
• Authors: Wanfu Gao, Jun Gao, Qingqi Han, Hanlin Pan, Kunpeng Liu,
• Abstract summary: Rapid growth in feature dimension may introduce implicit associations between features and labels in multi-label datasets.<n>Existing methods often adopt low-dimensional linear decomposition to explore the associations between features and labels.<n>We propose innovative solutions, including a random walk graph that integrates feature-feature, label-label, and feature-label relationships.
• Score: 6.529607327474487
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid growth in feature dimension may introduce implicit associations between features and labels in multi-label datasets, making the relationships between features and labels increasingly complex. Moreover, existing methods often adopt low-dimensional linear decomposition to explore the associations between features and labels. However, linear decomposition struggles to capture complex nonlinear associations and may lead to misalignment between the feature space and the label space. To address these two critical challenges, we propose innovative solutions. First, we design a random walk graph that integrates feature-feature, label-label, and feature-label relationships to accurately capture nonlinear and implicit indirect associations, while optimizing the latent representations of associations between features and labels after low-rank decomposition. Second, we align the variable spaces by leveraging low-dimensional representation coefficients, while preserving the manifold structure between the original high-dimensional multi-label data and the low-dimensional representation space. Extensive experiments and ablation studies conducted on seven benchmark datasets and three representative datasets using various evaluation metrics demonstrate the superiority of the proposed method\footnote{Code: https://github.com/Heilong623/-GRW-}.

Related papers

• Semi-Supervised Multi-Label Feature Selection with Consistent Sparse Graph Learning [13.401566810844368]
  Existing multi-label methods fail to evaluate the label correlations without enough labeled samples.<n>The similarity graph structure directly derived from the original feature space is suboptimal for multi-label problems.<n>We propose a consistent sparse graph learning method for multi-label semi-supervised feature selection.
  arXiv  Detail & Related papers  (2025-05-23T13:25:41Z)
• Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection [3.971316989443196]
  The purpose of partial multi-label feature selection is to select the most representative subset, where the data comes from partial multi-label datasets that have label ambiguity issues.<n>Previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features.<n>This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space.
  arXiv  Detail & Related papers  (2025-03-13T07:21:29Z)
• Multi-Label Contrastive Learning : A Comprehensive Study [48.81069245141415]
  Multi-label classification has emerged as a key area in both research and industry.<n>Applying contrastive learning to multi-label classification presents unique challenges.<n>We conduct an in-depth study of contrastive learning loss for multi-label classification across diverse settings.
  arXiv  Detail & Related papers  (2024-11-27T20:20:06Z)
• Optimized 3D Point Labeling with Leaders Using the Beams Displacement Method [14.377997862577182]
  Leadered labels have a large degree of freedom in position con-figuration.<n>We conceptualize the dynamic configuration process of computing label positions as akin to solving a map displacement problem.
  arXiv  Detail & Related papers  (2024-06-28T01:31:37Z)
• Adaptive Collaborative Correlation Learning-based Semi-Supervised Multi-Label Feature Selection [25.195711274756334]
  We propose an Adaptive Collaborative Correlation lEarning-based Semi-Supervised Multi-label Feature Selection (Access-MFS) method to address these issues.<n> Specifically, a generalized regression model equipped with an extended uncorrelated constraint is introduced to select discriminative yet irrelevant features.<n>The correlation instance and label correlation are integrated into the proposed regression model to adaptively learn both the sample similarity graph and the label similarity graph.
  arXiv  Detail & Related papers  (2024-06-18T01:47:38Z)
• Embedded Multi-label Feature Selection via Orthogonal Regression [45.55795914923279]
  State-of-the-art embedded multi-label feature selection algorithms based on at least square regression cannot preserve sufficient discriminative information in multi-label data. A novel embedded multi-label feature selection method is proposed to facilitate the multi-label feature selection. Extensive experimental results on ten multi-label data sets demonstrate the effectiveness of GRROOR.
  arXiv  Detail & Related papers  (2024-03-01T06:18:40Z)
• Label Learning Method Based on Tensor Projection [82.51786483693206]
  We propose a label learning method based on tensor projection (LLMTP) We extend the matrix projection transformation to tensor projection, so that the spatial structure information between views can be fully utilized. In addition, we introduce the tensor Schatten $p$-norm regularization to make the clustering label matrices of different views as consistent as possible.
  arXiv  Detail & Related papers  (2024-02-26T13:03:26Z)
• Exploring Homogeneous and Heterogeneous Consistent Label Associations for Unsupervised Visible-Infrared Person ReID [57.500045584556794]
  We introduce a Modality-Unified Label Transfer (MULT) module that simultaneously accounts for both homogeneous and heterogeneous fine-grained instance-level structures.<n>The proposed MULT ensures that the generated pseudo-labels maintain alignment across modalities while upholding structural consistency within intra-modality.<n> Experiments demonstrate that our proposed method outperforms existing state-of-the-art USL-VI-ReID methods.
  arXiv  Detail & Related papers  (2024-02-01T15:33:17Z)
• Graph Attention Transformer Network for Multi-Label Image Classification [50.0297353509294]
  We propose a general framework for multi-label image classification that can effectively mine complex inter-label relationships. Our proposed methods can achieve state-of-the-art performance on three datasets.
  arXiv  Detail & Related papers  (2022-03-08T12:39:05Z)
• Label-Assemble: Leveraging Multiple Datasets with Partial Labels [68.46767639240564]
  "Label-Assemble" aims to unleash the full potential of partial labels from an assembly of public datasets. We discovered that learning from negative examples facilitates both computer-aided disease diagnosis and detection.
  arXiv  Detail & Related papers  (2021-09-25T02:48:17Z)
• Dual-Refinement: Joint Label and Feature Refinement for Unsupervised Domain Adaptive Person Re-Identification [51.98150752331922]
  Unsupervised domain adaptive (UDA) person re-identification (re-ID) is a challenging task due to the missing of labels for the target domain data. We propose a novel approach, called Dual-Refinement, that jointly refines pseudo labels at the off-line clustering phase and features at the on-line training phase. Our method outperforms the state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2020-12-26T07:35:35Z)
• SPL-MLL: Selecting Predictable Landmarks for Multi-Label Learning [87.27700889147144]
  We propose to select a small subset of labels as landmarks which are easy to predict according to input (predictable) and can well recover the other possible labels (representative) We employ the Alternating Direction Method (ADM) to solve our problem. Empirical studies on real-world datasets show that our method achieves superior classification performance over other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-16T11:07:44Z)

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.