Improvement to Quick Attribution Reduction Algorithm
The attribute reduction is an important operation of decision table information system. Currently the most efficient algorithm is Xu Zhang Yan's RedueBaseSig algorithm,its time complications is max{O(|C||U|),O(|C|2|U|)}. However,in some cases,the algorithm is not obtained reduction. In the paper,we analyze the limitation of the Xu Zhang Yan's algorithm and propose an improvement to quick attribution reduction algorithm. The algorithm optimizes the method of the equivalence partition and computing positive region,uses core attributes as the initial reduction sets,and adds the most important condition attribute into the reduction sets. The time complexity of the improved algorithm is O(|C|2|U|) in the worst case. The experimental results show that the algorithm is correct and efficient.