An Efficient Attribute Reduction Algorithm Based on Concentrated Ordered Discernibility Set

The algorithm for attribute reduction based discernibility matrix needs to occupy a lot of memory space, and many elements of discernibility matrix are not unnecessary to reduction. The efficiency of the algorithm is not good when the scale of problem is very large. For solving the above deficiency, an attribute reduction algorithm based on concentrated ordered discernibility set is put forward. The algorithm is not need to create discernibility matrix and generate redundant elements, so it can cut down the storing and the computing capacity greatly, and the efficiency of the algorithm is improved. The time and space complexity of the algorithm are cut down to max{O(|C| |Upsila_pos| |U/C||MsCount|),O(|C|²|MsCount|)}and O(|MsCount|). The experimental results show that the algorithm is effective and efficient.