JOURNAL ARTICLE

Multilabel Feature Selection via Shared Latent Sublabel Structure and Simultaneous Orthogonal Basis Clustering

Ronghua ShangJingyu ZhongWeitong ZhangSonghua XuYangyang Li

Year: 2024 Journal:   IEEE Transactions on Neural Networks and Learning Systems Vol: 36 (3)Pages: 5288-5303   Publisher: Institute of Electrical and Electronics Engineers

Abstract

Multilabel feature selection solves the dimension distress of high-dimensional multilabel data by selecting the optimal subset of features. Noisy and incomplete labels of raw multilabel data hinder the acquisition of label-guided information. In existing approaches, mapping the label space to a low-dimensional latent space by semantic decomposition to mitigate label noise is considered an effective strategy. However, the decomposed latent label space contains redundant label information, which misleads the capture of potential label relevance. To eliminate the effect of redundant information on the extraction of latent label correlations, a novel method named SLOFS via shared latent sublabel structure and simultaneous orthogonal basis clustering for multilabel feature selection is proposed. First, a latent orthogonal base structure shared (LOBSS) term is engineered to guide the construction of a redundancy-free latent sublabel space via the separated latent clustering center structure. The LOBSS term simultaneously retains latent sublabel information and latent clustering center structure. Moreover, the structure and relevance information of nonredundant latent sublabels are fully explored. The introduction of graph regularization ensures structural consistency in the data space and latent sublabels, thus helping the feature selection process. SLOFS employs a dynamic sublabel graph to obtain a high-quality sublabel space and uses regularization to constrain label correlations on dynamic sublabel projections. Finally, an effective convergence provable optimization scheme is proposed to solve the SLOFS method. The experimental studies on the 18 datasets demonstrate that the presented method performs consistently better than previous feature selection methods.

Keywords:
Cluster analysis Computer science Artificial intelligence Data mining Pattern recognition (psychology) Probabilistic latent semantic analysis Redundancy (engineering)

Metrics

29
Cited By
18.52
FWCI (Field Weighted Citation Impact)
58
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Text and Document Classification Technologies
Physical Sciences →  Computer Science →  Artificial Intelligence
Web Data Mining and Analysis
Physical Sciences →  Computer Science →  Information Systems
Image Retrieval and Classification Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition

Related Documents

JOURNAL ARTICLE

Multilabel Feature Selection With Constrained Latent Structure Shared Term

Wanfu GaoYonghao LiLiang Hu

Journal:   IEEE Transactions on Neural Networks and Learning Systems Year: 2021 Vol: 34 (3)Pages: 1253-1262
JOURNAL ARTICLE

Unsupervised Feature Selection via Orthogonal Basis Clustering and Local Structure Preserving

Xiaochang LinJiewen GuanBilian ChenYifeng Zeng

Journal:   IEEE Transactions on Neural Networks and Learning Systems Year: 2021 Vol: 33 (11)Pages: 6881-6892
JOURNAL ARTICLE

Robust sparse orthogonal basis clustering for unsupervised feature selection

Jianyu MiaoJingjing ZhaoTiejun YangSiyu ZhuYong ShiMingliang Xu

Journal:   Expert Systems with Applications Year: 2025 Vol: 274 Pages: 126890-126890
© 2026 ScienceGate Book Chapters — All rights reserved.