基于互信息的无监督特征选择  

An Unsupervised Feature Selection Approach Based on Mutual Information

作　　者：徐峻岭[1,2] 周毓明[2,3] 陈林[2,3] 徐宝文[2,3] 

机构地区：[1]东南大学计算机科学与工程学院,南京210096 [2]计算机软件新技术国家重点实验室(南京大学),南京210093 [3]南京大学计算机科学与技术系,南京210093

出　　处：《计算机研究与发展》2012年第2期372-382,共11页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(61073029;90818027;60633010);国家"八六三"高技术研究发展计划基金项目(2009AA01Z147);国家"九七三"重点基础研究发展计划基金项目(2009CB320703)

摘　　要：在数据分析中,特征选择可以用来降低特征的冗余,提高分析结果的可理解性和发现高维数据中隐藏的结构.提出了一种基于互信息的无监督的特征选择方法(UFS-MI),在UFS-MI中,使用了一种综合考虑了相关度和冗余度的特征选择标准UmRMR(无监督最小冗余最大相关)来评价特征的重要性.相关度和冗余度分别使用互信息来度量特征与潜在类别变量之间的依赖和特征与特征之间的依赖.UFS-MI同时适用于数值型和非数值型特征.在理论上证明了UFS-MI的有效性,实验结果也表明UFS-MI可以达到与传统的特征选择方法相当甚至更好的性能.In data analysis, feature selection can be used to reduce the redundancy of features, improve the comprehensibility of models, and identify the hidden structures in high-dimensional data. In this paper, we propose a novel unsupervised feature selection approach based on mutual information called UFS-MI. In UFS-MI, we use a feature selection criterion, UrnRMR, to evaluate the importance of each feature, which takes into account both relevance and redundancy. The relevance and redundancy respectively use mutual information to measure the dependence of features on the latent class and the dependence between features. In the new algorithm, features are selected or ranked in a stepwise way, one at a time, by estimating the capability of each specified candidate feature to decrease the uncertainty of other features （i. e. the capability of retaining the information contained in other features）. The effectiveness of UFS-MI is confirmed by the theoretical proof which shows it can select features highly correlated with the latent class. An empirical comparison between UFS-MI and several traditional feature selection methods are also conducted on some popular data sets and the results show that UFS-MI can attain better or comparable performance and it is applicable to both numerical and non-numerical features.

关 键 词：特征选择 无监督特征选择 互信息 最小冗余-最大相关 无监督最小冗余-最大相关 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]