An Efficient Algorithm for Reduction of Attribute in Information Systems

An efficient algorithm for reduction of attribute in information systems is put forward, whose time complexity is max{O((|C|+|D|) |U|),O(|C|²|U|))}. Compared with those existing heuristic algorithms, its flexibility has been increased because calculating the important value of unimportant attribute repeatedly can be avoided by removing unimportant attributes gradually from the search space. The theoretical analysis and experimental results show that this algorithm is much less time complexity than those existed algorithms; and a real example demonstrates its feasibility and effectiveness, respectively.