首页> 外文期刊>Expert Systems with Application >Feature selection for high-dimensional multi-category data using PLS-based local recursive feature elimination
【24h】

Feature selection for high-dimensional multi-category data using PLS-based local recursive feature elimination

机译:使用基于PLS的局部递归特征消除的高维多类别数据特征选择

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper focuses on high-dimensional and ultrahigh dimensional multi-category problems and presents a feature selection framework based on local recursive feature elimination (Local-RFE). Using this analytical framework, we propose a new feature selection algorithm, PLS-based local-RFE (LRFE-PLS). In order to compare the effectiveness of the proposed methodology, we also present PLS-based Global-RFE which takes all categories into consideration simultaneously. The advantage of the proposed algorithms lies in the fact that PLS-based feature ranking can quickly delete irrelevant features and RFE can concurrently remove some redundant features. As a result, the selected feature subset is more compact. In this paper the proposed algorithms are compared to some state-of-the-art methods using multiple datasets. Experimental results show that the proposed algorithms are competitive and work effectively for high-dimensional multi-category data. Statistical tests of significance show that LRFE-PLS algorithm has better performance. The proposed algorithms can be effectively applied not only to microarray data analysis but also to image recognition and financial data analysis.
机译:本文重点研究高维和超高维多类别问题,并提出了一种基于局部递归特征消除(Local-RFE)的特征选择框架。使用此分析框架,我们提出了一种新的特征选择算法,即基于PLS的局部RFE(LRFE-PLS)。为了比较所提出方法的有效性,我们还提出了基于PLS的Global-RFE,该方法同时考虑了所有类别。提出的算法的优点在于以下事实:基于PLS的特征等级可以快速删除不相关的特征,而RFE可以同时删除一些冗余特征。结果,所选特征子集更加紧凑。在本文中,将提出的算法与使用多个数据集的一些最新方法进行了比较。实验结果表明,所提出的算法在高维多类别数据上具有竞争力,并能有效地工作。显着性统计检验表明,LRFE-PLS算法具有更好的性能。所提出的算法不仅可以有效地应用于微阵列数据分析,而且可以有效地应用于图像识别和财务数据分析。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号