Supervised Rank Aggregation (SRA): A Novel Rank Aggregation Approach for Ensemble-based Feature Selection

Q3 Computer Science
Rahi Jain, Wei Xu
{"title":"Supervised Rank Aggregation (SRA): A Novel Rank Aggregation\nApproach for Ensemble-based Feature Selection","authors":"Rahi Jain, Wei Xu","doi":"10.2174/0126662558277567231201063458","DOIUrl":null,"url":null,"abstract":"\n\nFeature selection (FS) is critical for high dimensional data analysis.\nEnsemble based feature selection (EFS) is a commonly used approach to develop FS techniques. Rank aggregation (RA) is an essential step in EFS where results from multiple models\nare pooled to estimate feature importance. However, the literature primarily relies on static\nrule-based methods to perform this step which may not always provide an optimal feature set.\nThe objective of this study is to improve the EFS performance using dynamic learning in RA\nstep.\n\n\n\nThis study proposes a novel Supervised Rank Aggregation (SRA) approach to allow\nRA step to dynamically learn and adapt the model aggregation rules to obtain feature importance.Method: This study proposes a novel Supervised Rank Aggregation (SRA) approach to allow\nRA step to dynamically learn and adapt the model aggregation rules to obtain feature importance.\n\n\n\nWe evaluate the performance of the algorithm using simulation studies and implement\nit into real research studies, and compare its performance with various existing RA methods.\nThe proposed SRA method provides better or at par performance in terms of feature selection\nand predictive performance of the model compared to existing methods.\n\n\n\nSRA method provides an alternative to the existing approaches of RA for EFS.\nWhile the current study is limited to the continuous cross-sectional outcome, other endpoints\nsuch as longitudinal, categorical, and time-to-event data could also be used.\n","PeriodicalId":36514,"journal":{"name":"Recent Advances in Computer Science and Communications","volume":"76 23","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Recent Advances in Computer Science and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2174/0126662558277567231201063458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection (FS) is critical for high dimensional data analysis. Ensemble based feature selection (EFS) is a commonly used approach to develop FS techniques. Rank aggregation (RA) is an essential step in EFS where results from multiple models are pooled to estimate feature importance. However, the literature primarily relies on static rule-based methods to perform this step which may not always provide an optimal feature set. The objective of this study is to improve the EFS performance using dynamic learning in RA step. This study proposes a novel Supervised Rank Aggregation (SRA) approach to allow RA step to dynamically learn and adapt the model aggregation rules to obtain feature importance.Method: This study proposes a novel Supervised Rank Aggregation (SRA) approach to allow RA step to dynamically learn and adapt the model aggregation rules to obtain feature importance. We evaluate the performance of the algorithm using simulation studies and implement it into real research studies, and compare its performance with various existing RA methods. The proposed SRA method provides better or at par performance in terms of feature selection and predictive performance of the model compared to existing methods. SRA method provides an alternative to the existing approaches of RA for EFS. While the current study is limited to the continuous cross-sectional outcome, other endpoints such as longitudinal, categorical, and time-to-event data could also be used.
监督等级聚合(SRA):基于集合的特征选择的新型等级聚合方法
基于集合的特征选择(EFS)是开发特征选择技术的常用方法。等级聚合(RA)是 EFS 中的一个重要步骤,它将多个模型的结果汇集在一起,以估计特征的重要性。本研究提出了一种新颖的监督等级聚合(SRA)方法,允许RA步骤动态学习和调整模型聚合规则,以获得特征重要性:本研究提出了一种新颖的监督等级聚合(SRA)方法,允许RA步骤动态学习和调整模型聚合规则,以获得特征重要性。我们通过模拟研究评估了该算法的性能,并将其应用到实际研究中,并将其性能与现有的各种RA方法进行了比较。与现有方法相比,所提出的 SRA 方法在特征选择和模型预测性能方面表现更好,甚至不相上下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Recent Advances in Computer Science and Communications
Recent Advances in Computer Science and Communications Computer Science-Computer Science (all)
CiteScore
2.50
自引率
0.00%
发文量
142
×
引用
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学术官方微信