返回
Feature subset selection combining maximal information entropy and maximal information coefficient
DOI:10.1007/s10489-019-01537-x.png)
摘要
En 中文
Feature subset selection is an efficient step to reduce the dimension of data, which remains an active research field in decades. In order to develop highly accurate and fast searching feature subset selection algorithms, a filter feature subset selection method combining maximal information entropy (MIE) and the maximal information coefficient (MIC) is proposed in this paper. First, a new metric mMIE-mMIC is defined to minimize the MIE among features while maximizing the MIC between the features and the class label. The mMIE-mMIC algorithm is designed to evaluate whether a candidate subset is valid for classification. Second, two searching strategies are adopted to identify a suitable solution in the candidate subset space, including the binary particle swarm optimization algorithm (BPSO) and sequential forward selection (SFS). Finally, classification is performed on UCI datasets to validate the performance of our work compared to 9 existing methods. Experimental results show that in most cases, the proposed method behaves equally or better than the other 9 methods in terms of classification accuracy and F1-score.
Keyword:
Feature subset selection
BPSO
MIC
SFS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Mode Selection and Resource Allocation in Device-to-Device Communications With User Arrivals and Departures
IEEE ACCESS
IF3.6
A novel feature selection method based on normalized mutual information一种基于归一化互信息的特征选择方法
APPLIED INTELLIGENCE
IF3.5
A Novel Algorithm for the Precise Calculation of the Maximal Information Coefficient
SCIENTIFIC REPORTS
IF3.9
Feature selection method with joint maximal information entropy between features and class特征与类间联合最大信息熵的特征选择方法
PATTERN RECOGNITION
IF7.6

