Compression of dynamic fuzzy relation information systems
Mingjie Cai, Qingguo Li, Guangming Lang
TL;DR
This paper presents a new algorithm for compressing dynamic fuzzy relation information systems, enabling significant simplification of data while maintaining essential information, which advances data management in fuzzy systems.
Contribution
The paper introduces a novel homomorphism construction algorithm and demonstrates how to effectively compress dynamic fuzzy relation information systems.
Findings
The proposed algorithm effectively constructs homomorphisms for fuzzy systems.
Data compression significantly simplifies dynamic fuzzy relation information systems.
Illustrative examples confirm the efficiency of the proposed methods.
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Data Management and Algorithms · Advanced Algebra and Logic