计算机科学
特征选择
相互信息
最小冗余特征选择
冗余(工程)
交互信息
人工智能
信息增益
算法
条件互信息
模式识别(心理学)
特征(语言学)
机器学习
选择(遗传算法)
数据挖掘
熵(时间箭头)
相关性(法律)
数学
语言学
哲学
统计
政治学
法学
操作系统
作者
Xiangyuan Gu,Jun Guo,Lixin Xiao,Chongyi Li
标识
DOI:10.1007/s10489-021-02412-4
摘要
There are many feature selection algorithms based on mutual information and three-dimensional mutual information (TDMI) among features and the class label, since these algorithms do not consider TDMI among features, feature selection performance can be influenced. In view of the problem, this paper investigates feature selection based on TDMI among features. According to the maximal relevance minimal redundancy criterion, joint mutual information among the class label and feature set is adopted to describe relevance, and mutual information between feature set is exploited to describe redundancy. Then, joint mutual information among the class label and feature set as well as mutual information between feature set is decomposed. In the process of decomposing, TDMI among features is considered and an objective function is obtained. Finally, a feature selection algorithm based on conditional mutual information for maximal relevance minimal redundancy (CMI-MRMR) is proposed. To validate the performance, we compare CMI-MRMR with several feature selection algorithms. Experimental results show that CMI-MRMR can achieve better feature selection performance.
科研通智能强力驱动
Strongly Powered by AbleSci AI