Abstract
Information system homomorphisms have made a substantial contribution to attribute reduction of covering information systems. However, the efforts made on homomorphisms are far from sufficient. This paper further studies homomorphisms for attribute reduction of dynamic fuzzy covering information systems. First, the concepts of neighbourhood and induced fuzzy covering are proposed and their properties are discussed in detail. Then, we introduce the concepts of consistent functions and fuzzy covering mappings providing a basic theoretical foundation for compressing fuzzy covering information systems. Afterwards, the notion of homomorphisms is presented to reveal the relationship between fuzzy covering information systems. We show how large-scale fuzzy covering information systems and dynamic fuzzy covering information systems can be compressed into smaller ones by means of homomorphisms. Finally, illustrative examples are employed to show that attribute reduction can be simplified significantly by our proposed approach.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
