Abstract

Attribute reduction of rough set theory underlies knowledge acquisition and has two hierarchical types (classification-based and class-specific attribute reducts) and two perspectives from algebra and information theory; thus, there are four combined modes in total. Informational class-specific reducts are fundamental but lacking and are thus investigated by correspondingly constructing class-specific information measures. First, three types of information measures (i.e., information entropy, conditional entropy, and mutual information) are novelly established at the class level by hierarchical decomposition to acquire their hierarchical connection, systematical relationship, uncertainty semantics, and granulation monotonicity. Second, three types of informational class-specific reducts are correspondingly proposed to acquire their internal relationship, basic properties, and heuristic algorithm. Third, the informational class-specific reducts achieve their transverse connections, including the strength feature and consistency degeneration, with the algebraic class-specific reducts and their hierarchical connections, including the hierarchical strength and balance, with the informational classification-based reducts. Finally, relevant information measures and attribute reducts are effectively verified by decision tables and data experiments. Class-specific information measures deepen existing classification-based information measures by a hierarchical isomorphism, while the informational class-specific reducts systematically perfect attribute reduction by level and viewpoint isomorphisms; these results facilitate uncertainty measurement and information processing, especially at the class level.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.