Abstract
The introduction of information system homomorphisms has made a substantial contribution to attribute reduction. However, the efforts made on homomorphisms are far from sufficient. This paper further investigates homomorphisms between covering approximation spaces. First, we introduce the concepts of upper and lower homomorphisms as well as homomorphisms in order to study the relationship between covering approximation spaces. Then we present the notions of covering approximation subspaces and product spaces. We also compress covering approximation spaces and covering information systems with the aim of attribute reduction. Afterwards, by utilizing the compressions of the original spaces and systems we compress the dynamic covering approximation spaces and dynamic covering information systems. Several illustrative examples are employed to demonstrate that the homomorphisms provide an effective approach for compressing covering approximation spaces and covering information systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.