Parallel algorithm of attributes reduction of information system
一种并行的信息系统属性约简算法*

The reduction of attributes is an important operation of information system, and classification is the basis of attri-bute reduction. The attribute reduction would generally be inefficient if the huge data sets were mined directly by the algorithm. So this paper proposed a parallel algorithm of attributes reduction of information system which based on entropy of information. Through calculating the entropy of information, this algorithm which on basis of classification disassembled the information system into multi-table as symmetrical as possible while reducing the attributes. So the algorithm achieved a parallel calculation of attribute reduction and lessen the searching roomage. This paper also analyzed the time complexity of the algorithm. The experiment shows that the new algorithm is more effective than the traditional algorithm.