An efficient rough feature selection algorithm with a multi-granulation view

详细信息	查看全文 | 推荐本文 |

• 作者：Jiye Liang^a ; ^{ljy@sxu.edu.cn} ; Feng Wang^a ; ^b ; ^{sxuwangfeng@126.com} ; Chuangyin Dang^b ; ^{mecdang@cityu.edu.hk} ; Yuhua Qian^a ; ^{jinchengqyh@126.com}
• 关键词：Feature selection ; Multi-granulation view ; Rough set theory ; Large-scale data sets
• 刊名：International Journal of Approximate Reasoning
• 出版年：2012
• 期刊代码：76_0888613x
• 类别：et
• 出版时间：September, 2012
• 卷：53
• 期：6
• 页码：912-926
• 文件大小：334 K

摘要

Feature selection is a challenging problem in many areas such as pattern recognition, machine learning and data mining. Rough set theory, as a valid soft computing tool to analyze various types of data, has been widely applied to select helpful features (also called attribute reduction). In rough set theory, many feature selection algorithms have been developed in the literatures, however, they are very time-consuming when data sets are in a large scale. To overcome this limitation, we propose in this paper an efficient rough feature selection algorithm for large-scale data sets, which is stimulated from multi-granulation. A sub-table of a data set can be considered as a small granularity. Given a large-scale data set, the algorithm first selects different small granularities and then estimate on each small granularity the reduct of the original data set. Fusing all of the estimates on small granularities together, the algorithm can get an approximate reduct. Because of that the total time spent on computing reducts for sub-tables is much less than that for the original large-scale one, the algorithm yields in a much less amount of time a feature subset (the approximate reduct). According to several decision performance measures, experimental results show that the proposed algorithm is feasible and efficient for large-scale data sets.