基于图的特征选择算法综述  

A survey of feature selection algorithms based on graph

作　　者：张文静[1] 王备战[1] 张志宏[1] 

机构地区：[1]厦门大学软件学院,福建厦门361005

出　　处：《安徽大学学报（自然科学版）》2017年第1期10-20,共11页Journal of Anhui University(Natural Science Edition)

基　　金：国家自然科学基金青年基金资助项目(20090451384)

摘　　要：特征选择作为数据处理的预步骤成为近年来的研究热点.借鉴图的方法,可认为重要的特征应该具有使同类样本更加聚集在同类之中,而使非同类样本间的间隔应该尽可能大的特点.首先详细介绍了当前常用的基于图的特征选择算法,并对其进行了分类比较;接着给出了当前基于图的特征选择算法存在的问题;最后指出了基于图的特征选择算法的研究趋势.Feature selection as the pre-step in the data processing has become a hot topic in recent years. Using the methods of graphs, it can be considered that the important features should be more aggregated in the same class, and more dispersed in the different class. This paper firstly introduced classification and compared the current familiar feature selection algorithms based on graph. Secondly, it pointed out the existing problems of feature selection algorithms based on graph. Finally, this paper involved what calls for future study.

关 键 词：特征选择 图 数据处理 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]