A Practicable Heuristic Attributes Reduction Algorithm for Ordered Information Systems

摘要

Rough set theory is a mathematic tool to handlevague and uncertain knowledge. The core problem of rough set theory is the reduction of attributes. This paperintroduces apresentation of the information granularity for ordered information systems based on dominance relation, and detail the way to calculate the attribute importance based on the information granularity we have defined. On that basis, put forward a heuristic attribute reduction algorithm for ordered information systems. Experiments show that the algorithm performs well and outperforms some other rivals.