Multi-label feature selection via nonlinear mapping and manifold regularization

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-06-01 Epub Date: 2025-02-11 DOI:10.1016/j.ins.2025.121965
Yan Wang , Changzhong Wang , Tingquan Deng , Wenqi Li
{"title":"Multi-label feature selection via nonlinear mapping and manifold regularization","authors":"Yan Wang ,&nbsp;Changzhong Wang ,&nbsp;Tingquan Deng ,&nbsp;Wenqi Li","doi":"10.1016/j.ins.2025.121965","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection has become a critical research focus within the field of multi-label learning, where traditional methods largely rely on the assumption of linearity between features and target labels. Nevertheless, in many real-world scenarios, features and labels are often associated with each other through complex nonlinear relationships. As a result, there is a urgent need to incorporate nonlinear mappings to accurately capture the underlying connections between features and labels. To address this, we propose a novel multi-label feature selection method that leverages nonlinear mapping and manifold regularization (NMMFS). Specifically, we first analyze the semantic similarity and correlations among labels, refining semantic labels using matrix decomposition techniques. Next, we construct a nonlinear mapping from the original features to the semantic labels through the sigmoid function. This ensures that the output values of the nonlinear mapping remain within the [0,1] interval, better aligning with the distribution of semantic labels. To maintain data structure consistency during this transformation, we apply manifold learning as a regularization technique. The experimental results show that the proposed algorithm greatly surpasses existing mainstream ones in terms of performance metrics, validating its theoretical feasibility and technical advantages.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"704 ","pages":"Article 121965"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525000970","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/11 0:00:00","PubModel":"Epub","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection has become a critical research focus within the field of multi-label learning, where traditional methods largely rely on the assumption of linearity between features and target labels. Nevertheless, in many real-world scenarios, features and labels are often associated with each other through complex nonlinear relationships. As a result, there is a urgent need to incorporate nonlinear mappings to accurately capture the underlying connections between features and labels. To address this, we propose a novel multi-label feature selection method that leverages nonlinear mapping and manifold regularization (NMMFS). Specifically, we first analyze the semantic similarity and correlations among labels, refining semantic labels using matrix decomposition techniques. Next, we construct a nonlinear mapping from the original features to the semantic labels through the sigmoid function. This ensures that the output values of the nonlinear mapping remain within the [0,1] interval, better aligning with the distribution of semantic labels. To maintain data structure consistency during this transformation, we apply manifold learning as a regularization technique. The experimental results show that the proposed algorithm greatly surpasses existing mainstream ones in terms of performance metrics, validating its theoretical feasibility and technical advantages.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于非线性映射和流形正则化的多标签特征选择
特征选择已经成为多标签学习领域的一个重要研究热点,传统的方法很大程度上依赖于特征与目标标签之间的线性假设。然而,在许多现实场景中,特征和标签往往通过复杂的非线性关系相互关联。因此,迫切需要结合非线性映射来准确地捕获特征和标签之间的潜在联系。为了解决这个问题,我们提出了一种新的多标签特征选择方法,该方法利用非线性映射和流形正则化(NMMFS)。具体来说,我们首先分析标签之间的语义相似度和相关性,使用矩阵分解技术对语义标签进行细化。接下来,我们通过sigmoid函数构造了原始特征到语义标签的非线性映射。这确保了非线性映射的输出值保持在[0,1]区间内,更好地与语义标签的分布对齐。为了在转换过程中保持数据结构的一致性,我们将流形学习作为一种正则化技术。实验结果表明,该算法在性能指标上大大优于现有主流算法,验证了其理论可行性和技术优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Matrix-based incremental reduction in neighborhood covering decision information systems Cross-chain identity privacy protection scheme based on oblivious transfer protocol and key agreement The subgraph eigenvector centrality of graphs Collaborative neurodynamic approach on multi-objective optimization of wind power systems Research on pricing Asian carbon options for an uncertain exponential Ornstein-Uhlenbeck model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1