Feature selections integrating algebraic and information perspectives in weighted incomplete neighborhood rough sets

IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neurocomputing Pub Date : 2025-04-12 DOI:10.1016/j.neucom.2025.130164
Shan Zhang, Jiucheng Xu, Qing Bai
{"title":"Feature selections integrating algebraic and information perspectives in weighted incomplete neighborhood rough sets","authors":"Shan Zhang,&nbsp;Jiucheng Xu,&nbsp;Qing Bai","doi":"10.1016/j.neucom.2025.130164","DOIUrl":null,"url":null,"abstract":"<div><div>In data-driven scientific research and practical applications, data incompleteness and uncertainty are widespread issues that have become critical bottlenecks, restricting the accuracy of data analysis and the reliability of decision-making. Addressing the limitations of existing incomplete rough set models, which predominantly focus on uncertainty measurement adjustment while overlooking feature weighting and neighborhood relation construction, this paper proposes feature selection methods based on a weighted incomplete neighborhood rough set framework, integrating algebraic and information perspectives. Firstly, a weighted tolerance neighborhood relation is introduced to better quantify uncertainty, enhancing adaptability in classification and feature selection tasks. Secondly, from the algebraic perspective, three weighted measures are developed: weighted approximation accuracy, weighted information granularity, and weighted approximation precision based on information granularity. These measures are combined with information-theoretic metrics such as mutual information, complementary mutual information, and self-information to form nine fusion measures. Finally, a unified feature selection algorithmic framework is designed to comprehensively evaluate feature importance. Experimental results demonstrate that the proposed methods significantly improve classification accuracy across 12 datasets. Notably, under a 10% incompleteness rate, the GASI-FS, GMI-FS, and AMI-FS algorithms achieve classification accuracies of 87.31%, 85.87%, and 86.79% on KNN, CART, and SVM classifiers, respectively, outperforming other methods. These findings provide a robust theoretical foundation and practical tools for analyzing incomplete data in complex scenarios.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"639 ","pages":"Article 130164"},"PeriodicalIF":6.5000,"publicationDate":"2025-04-12","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/S0925231225008367","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

In data-driven scientific research and practical applications, data incompleteness and uncertainty are widespread issues that have become critical bottlenecks, restricting the accuracy of data analysis and the reliability of decision-making. Addressing the limitations of existing incomplete rough set models, which predominantly focus on uncertainty measurement adjustment while overlooking feature weighting and neighborhood relation construction, this paper proposes feature selection methods based on a weighted incomplete neighborhood rough set framework, integrating algebraic and information perspectives. Firstly, a weighted tolerance neighborhood relation is introduced to better quantify uncertainty, enhancing adaptability in classification and feature selection tasks. Secondly, from the algebraic perspective, three weighted measures are developed: weighted approximation accuracy, weighted information granularity, and weighted approximation precision based on information granularity. These measures are combined with information-theoretic metrics such as mutual information, complementary mutual information, and self-information to form nine fusion measures. Finally, a unified feature selection algorithmic framework is designed to comprehensively evaluate feature importance. Experimental results demonstrate that the proposed methods significantly improve classification accuracy across 12 datasets. Notably, under a 10% incompleteness rate, the GASI-FS, GMI-FS, and AMI-FS algorithms achieve classification accuracies of 87.31%, 85.87%, and 86.79% on KNN, CART, and SVM classifiers, respectively, outperforming other methods. These findings provide a robust theoretical foundation and practical tools for analyzing incomplete data in complex scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
加权不完全邻域粗糙集中代数与信息观点相结合的特征选择
在数据驱动的科学研究和实际应用中,数据的不完整性和不确定性是普遍存在的问题,已成为制约数据分析准确性和决策可靠性的关键瓶颈。针对现有不完全粗糙集模型主要关注不确定性度量调整而忽略特征加权和邻域关系构建的局限性,提出了基于加权不完全粗糙集框架的特征选择方法,将代数视角与信息视角相结合。首先,引入加权容差邻域关系,更好地量化不确定性,增强分类和特征选择任务的适应性;其次,从代数的角度,提出了加权逼近精度、加权信息粒度和基于信息粒度的加权逼近精度三个加权度量。这些度量与互信息、互补互信息、自信息等信息论度量相结合,形成9个融合度量。最后,设计了统一的特征选择算法框架,对特征重要性进行综合评价。实验结果表明,该方法在12个数据集上显著提高了分类精度。值得注意的是,在不完备率为10%的情况下,GASI-FS、GMI-FS和AMI-FS算法在KNN、CART和SVM分类器上的分类准确率分别达到87.31%、85.87%和86.79%,优于其他方法。这些发现为分析复杂场景下的不完整数据提供了坚实的理论基础和实用工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Dual perspective hierarchical alignment network for joint multimodal aspect-based sentiment analysis A functional neuron with thermal perception and energy regulation MPD-GS: Mask-guided point densification for Gaussian splatting NVFusion: Lightweight infrared and low-light night vision image fusion in dark environments Unrolling operator splitting in learning PDEs for object detection
×
引用
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