2000 character limit reached
Compression of dynamic fuzzy relation information systems
Published 28 Sep 2012 in cs.IT and math.IT | (1210.0003v2)
Abstract: This paper further investigates the data compression of fuzzy relation information systems. First, we introduce an algorithm for constructing the homomorphism between fuzzy relation information systems. Then, we discuss that how to compress the dynamic fuzzy relation information systems by utilizing the compression of the original systems. Afterwards, several illustrative examples are employed to show that the data compression of fuzzy relation information systems and dynamic fuzzy relation information systems can be simplified significantly by our proposed
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.