Abstract
In this study, we formally investigate how to determine fuzzy/linguistic IF–THEN rules that are redundant in linguistic descriptions (systems of IF–THEN rules). We present a formal definition of redundancy and show that seemingly redundant rules can in fact be indispensable. These results apply to IF–THEN rules that use evaluative expressions (e.g., small and very big) and the inference method called perception-based logical deduction. However, they are also valid for inference systems with compatible design choices. We also describe an algorithm for the automatic detection and removal of redundant rules. Finally, we present an example of a linguistic description that is learned automatically from data and reduced using our algorithm.
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.