Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Lang et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: