首页> 外文期刊>Information Sciences: An International Journal >A multi-objective evolutionary algorithm for feature selection based on mutual information with a new redundancy measure
【24h】

A multi-objective evolutionary algorithm for feature selection based on mutual information with a new redundancy measure

机译:一种基于互信息和冗余度量的多目标进化特征选择算法

获取原文
获取原文并翻译 | 示例
           

摘要

Feature selection is an important task in data mining and pattern recognition, especially for high-dimensional data. It aims to select a compact feature subset with the maximal discriminative capability. The discriminability of a feature subset requires that selected features have a high relevance to class labels, whereas the compactness demands a low redundancy within the selected feature subset. This paper defines a new feature redundancy measurement capable of accurately estimating mutual information between features with respect to the target class (MIFS-CR). Based on a relevance measure and this new redundancy measure, a multi-objective evolutionary algorithm with class-dependent redundancy for feature selection (MECY-FS) is presented. The MECY-FS algorithm employs the Pareto optimality to evaluate candidate feature subsets and finds compact feature subsets with both the maximal relevance and the minimal redundancy. Experiments on benchmark datasets are conducted to validate the effectiveness of the new redundancy measure, and the MECY-FS algorithm is verified to be able to generate compact feature subsets with a high predictive capability. (C) 2015 Elsevier Inc. All rights reserved.
机译:特征选择是数据挖掘和模式识别中的重要任务,尤其是对于高维数据。它旨在选择具有最大判别能力的紧凑特征子集。特征子集的可区分性要求所选特征与类标签具有高度相关性,而紧凑性要求所选特征子集内的冗余度较低。本文定义了一种新的特征冗余度量,该度量能够相对于目标类别(MIFS-CR)准确估计特征之间的相互信息。基于相关性度量和这种新的冗余度量,提出了一种基于类的冗余特征选择(MECY-FS)的多目标进化算法。 MECY-FS算法利用帕累托最优性评估候选特征子集,并找到具有最大相关性和最小冗余度的紧凑特征子集。对基准数据集进行了实验,以验证新冗余度量的有效性,并且对MECY-FS算法进行了验证,能够生成具有高预测能力的紧凑特征子集。 (C)2015 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号