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

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
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":5.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.
加权不完全邻域粗糙集中代数与信息观点相结合的特征选择
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信