Abstract
We eliminate unnecessary computations of attribute discernibility sets in discernibility matrix-based methods (DM-methods) of attribute reduction in concept lattices. We obtain a polynomial time algorithm we call a Skim DM-method. The Skim DM-method however is merely slightly different from the standard clarification and reduction (CR-method). This result enables us to express a relationship of the CR-method and the DM-methods: the DM-methods are basically the CR-method with up to an exponential amount of unnecessary computations. Additionally, we experimentally evaluate the Skim DM-method in comparison with the CR-method.
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.
