一种基于粗糙集启发式的特征选择算法  

A Novel Feature Selection Heuristic Algorithm Based on Rough Set Theory

作　　者：梁琰[1] 何中市[1] 

机构地区：[1]重庆大学计算机学院,重庆400044

出　　处：《计算机科学》2007年第6期162-165,共4页Computer Science

基　　金：国家自然科学基金资助(资助号:60173060)。

摘　　要：本文基于粗糙集中关于非精确集和精确集理论思想,提出了一个新的特征度量指标,即相对互信息比RMI,由此,设计了一种基于粗糙集的启发式特征选择算法MRMI-UC。首先利用可辨识矩阵,计算出条件属性相对于决策属性的核,以核形成当前候选特征子集作为基准点,以最大化相对互信息和不确定性系数为原则,筛选剩余特征。通过对比实验,结果表明,本文提出的算法在多数情况下能够得到较优的特征子集,算法是有效的,切实可行的。In this paper, a new feature measurement RMI （Ratio of Mutual Information）is presented based on the concept of rough set theory about certain set and uncertain set. Then a novel heuristic algorithm, MRMI-UC （Algorithm based on Maximal Ratio of RMI and Uncertainty Coefficient）, is proposed for Feature Selection based on rough set theory. Firstly, the Core is obtained by discernible matrix and formed as a candidate feature subset. With the starting point of Core, the rest features are filtered iteratively to maximize both RMI and Uncertainty Coefficient. Finally the algorithm is tested on the UCI datasets, experiment results show that MRMI-UC is feasible and can find a good feature subset in most cases.

关 键 词：特征选择 粗糙集理论 启发式算法 不确定性系数 互信息 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]