Bilinear Self-Representation for Unsupervised Feature Selection with Structure Learning

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hossein Nasser Assadi , Faranges Kyanfar , Farid Saberi-Movahed , Abbas Salemi
{"title":"Bilinear Self-Representation for Unsupervised Feature Selection with Structure Learning","authors":"Hossein Nasser Assadi ,&nbsp;Faranges Kyanfar ,&nbsp;Farid Saberi-Movahed ,&nbsp;Abbas Salemi","doi":"10.1016/j.neucom.2025.129557","DOIUrl":null,"url":null,"abstract":"<div><div>Current feature selection approaches based on self-representation focus solely on representing either the sample space or the feature space. Consequently, a common challenge in such methods arises from the limited interaction between the feature and sample spaces, which can potentially result in incomplete discovery of hidden data information. To address this challenge, this paper introduces a novel mixture-level self-representation method called Bilinear Self-representation for Unsupervised Feature Selection with Structure Learning (BSUFSL). The newly proposed method, BSUFSL, distinguishes itself from existing feature selection approaches based on self-representation by utilizing the concept of bilinearity. This allows BSUFSL to capture self-representation in both the feature and sample spaces, integrating information from both domains and establishing an effective interaction between them to identify the most significant features. Meanwhile, BSUFSL incorporates local preservation to maintain geometric structure among features and global preservation to maximize data variance, both of which are essential aspects of structure learning. An efficient iterative optimization algorithm with theoretically guaranteed convergence is also developed to solve the BSUFSL model. Experimental results on eight benchmark datasets demonstrate the superior effectiveness of BSUFSL compared to state-of-the-art methods. Specifically, the numerical results reveal a significant improvement in clustering performance across several datasets. Furthermore, results from experiments confirm that BSUFSL enhances the clarity and accuracy of clustering by selecting discriminative features, thanks to its bilinear structure, which integrates feature and sample self-representation into a unified framework.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"625 ","pages":"Article 129557"},"PeriodicalIF":5.5000,"publicationDate":"2025-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225002292","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Current feature selection approaches based on self-representation focus solely on representing either the sample space or the feature space. Consequently, a common challenge in such methods arises from the limited interaction between the feature and sample spaces, which can potentially result in incomplete discovery of hidden data information. To address this challenge, this paper introduces a novel mixture-level self-representation method called Bilinear Self-representation for Unsupervised Feature Selection with Structure Learning (BSUFSL). The newly proposed method, BSUFSL, distinguishes itself from existing feature selection approaches based on self-representation by utilizing the concept of bilinearity. This allows BSUFSL to capture self-representation in both the feature and sample spaces, integrating information from both domains and establishing an effective interaction between them to identify the most significant features. Meanwhile, BSUFSL incorporates local preservation to maintain geometric structure among features and global preservation to maximize data variance, both of which are essential aspects of structure learning. An efficient iterative optimization algorithm with theoretically guaranteed convergence is also developed to solve the BSUFSL model. Experimental results on eight benchmark datasets demonstrate the superior effectiveness of BSUFSL compared to state-of-the-art methods. Specifically, the numerical results reveal a significant improvement in clustering performance across several datasets. Furthermore, results from experiments confirm that BSUFSL enhances the clarity and accuracy of clustering by selecting discriminative features, thanks to its bilinear structure, which integrates feature and sample self-representation into a unified framework.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信