An information bottleneck approach for feature selection

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pattern Recognition Pub Date : 2025-08-01 Epub Date: 2025-03-13 DOI:10.1016/j.patcog.2025.111564
Qi Zhang , Mingfei Lu , Shujian Yu , Jingmin Xin , Badong Chen
{"title":"An information bottleneck approach for feature selection","authors":"Qi Zhang ,&nbsp;Mingfei Lu ,&nbsp;Shujian Yu ,&nbsp;Jingmin Xin ,&nbsp;Badong Chen","doi":"10.1016/j.patcog.2025.111564","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection has been studied extensively over the last few decades. As a widely used method, the information-theoretic feature selection methods have attracted considerable attention due to their better interpretation and desirable performance. From an information-theoretic perspective, a golden rule for feature selection is to maximize the mutual information <span><math><mrow><mi>I</mi><mrow><mo>(</mo><msub><mrow><mi>X</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>,</mo><mi>Y</mi><mo>)</mo></mrow></mrow></math></span> between the selected feature subset <span><math><msub><mrow><mi>X</mi></mrow><mrow><mi>s</mi></mrow></msub></math></span> and the class labels <span><math><mi>Y</mi></math></span>. Despite its simplicity, explicitly optimizing this objective is a non-trivial task. In this work, we propose a novel global neural network-based feature selection framework with the information bottleneck principle and establish its connection to the rule of maximizing <span><math><mrow><mi>I</mi><mrow><mo>(</mo><msub><mrow><mi>X</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>,</mo><mi>Y</mi><mo>)</mo></mrow></mrow></math></span>. Using the matrix-based Rényi’s <span><math><mi>α</mi></math></span>-order entropy functional, our framework enjoys a simple and tractable objective without any variational approximation or distributional assumption. We further extend the framework to multi-view scenarios and verify it with two large-scale, high-dimensional real-world biomedical applications. Comprehensive experimental results demonstrate the superior performance of our framework not only in terms of classification accuracy but also in terms of good interpretability within and across each view, effectively proving that the proposed framework is trustworthy. Code is available at <span><span>https://github.com/archy666/IBFS</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"164 ","pages":"Article 111564"},"PeriodicalIF":7.6000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325002249","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection has been studied extensively over the last few decades. As a widely used method, the information-theoretic feature selection methods have attracted considerable attention due to their better interpretation and desirable performance. From an information-theoretic perspective, a golden rule for feature selection is to maximize the mutual information I(Xs,Y) between the selected feature subset Xs and the class labels Y. Despite its simplicity, explicitly optimizing this objective is a non-trivial task. In this work, we propose a novel global neural network-based feature selection framework with the information bottleneck principle and establish its connection to the rule of maximizing I(Xs,Y). Using the matrix-based Rényi’s α-order entropy functional, our framework enjoys a simple and tractable objective without any variational approximation or distributional assumption. We further extend the framework to multi-view scenarios and verify it with two large-scale, high-dimensional real-world biomedical applications. Comprehensive experimental results demonstrate the superior performance of our framework not only in terms of classification accuracy but also in terms of good interpretability within and across each view, effectively proving that the proposed framework is trustworthy. Code is available at https://github.com/archy666/IBFS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
特征选择的信息瓶颈方法
在过去的几十年里,特征选择得到了广泛的研究。作为一种应用广泛的特征选择方法,信息论特征选择方法以其较好的解释性和良好的性能而备受关注。从信息论的角度来看,特征选择的黄金法则是最大化所选特征子集x与类标签Y之间的互信息I(Xs,Y),尽管它很简单,但显式优化这一目标是一项不平凡的任务。在这项工作中,我们提出了一种新的基于信息瓶颈原理的全局神经网络特征选择框架,并建立了它与最大化I(Xs,Y)规则的联系。该框架采用基于矩阵的rsamnyi α阶熵函数,不需要任何变分近似和分布假设,目标简单易行。我们进一步将该框架扩展到多视图场景,并通过两个大规模、高维的现实生物医学应用来验证它。综合实验结果表明,我们的框架不仅在分类精度方面表现优异,而且在每个视图内部和跨视图具有良好的可解释性,有效地证明了我们提出的框架是值得信赖的。代码可从https://github.com/archy666/IBFS获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
期刊最新文献
IrisMAE: Structure-aware masked image modeling for iris recognition Minimizing the pretraining gap: Domain-aligned text-based person retrieval Stealthy backdoor attack method targeting group fairness in self-supervised learning Single-domain generalization for fastener detection via sample reconstruction and class-wise domain contrast EdgeFusionNet: Edge information-guided small object detection for remote sensing images
×
引用
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