{"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.