2012 | OriginalPaper | Buchkapitel
A Practicable Heuristic Attributes Reduction Algorithm for Ordered Information Systems
verfasst von : Wei Li, Feng Liu, Zhi-hong Zhao
Erschienen in: Foundations of Intelligent Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.