一种结合粗糙集理论和启发式知识的特征选取算法  

Heuristic Algorithm Based on Rough Set Theory for Feature Selection

作　　者：何苗[1] 李春葆[1] 

机构地区：[1]武汉大学计算机科学系,湖北武汉430079

出　　处：《计算机应用》2003年第2期113-115,共3页journal of Computer Applications

摘　　要：通常数据库会包含很多冗余特征,找出重要的特征子集叫做特征选取。粗糙集理论提供了一种数学工具来发现所有可能的特征子集。但因为发现的特征子集的数目通常非常庞大,遍历所有子集将非常耗时。文章介绍一种算法,它结合了粗糙集理论和贪心的启发性知识来有效进行特征子集选取。A database always contains a lot of attributes(sometimes instead of feature) that are redundant and not necessary for rule discovery. Feature selection is to find optimal feature subset. Rough set theory provides a mathematical tool that can be used to find out all possible feature subsets. Unfortunately, the number of possible subsets is always very large. Hence examining exhaustively all subsets of features is too time consuming. In this paper, we introduce an algorithm which is using rough set theory with greedy heuristics for feature selection.

关 键 词：粗糙集理论 启发式知识 特征选取算法 知识发现 数据库 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TP18[自动化与计算机技术—计算机科学与技术]