Heuristic Algorithm for Attributes Reduction in Ordered Information Systems

A definition of attribute significance is proposed based on knowledge rough entropy in ordered information systems,and important properties are obtained.It can be found that using the definition can measure uncertainty of an attribute set in the ordered information systems.A heuristic algorithm for attributes reduction is acquired in the systems.An example illustrates the validity of this algorithm,and results show that the algorithm is an efficient tool for data mining,and provides an important theoretical basis for knowledge discovery in ordered information systems.