Attribute reduction algorithm for huge data based on rough set theory
一种基于Rough集的海量数据属性约简方法

The attribute reduction of huge data is a difficult problem in the research of data mining. At present, many attribute reduction algorithms lack consideration on space complexity, which makes them cannot adapt to the reduction of large data set. In this paper, an attribute reduction algorithm of ordered attributes was proposed based on the divide and conquer, and this algorithm can be used to deal with huge data reduction. Simulation results show the efficiency of the algorithm.