Abstract

In three-way concept analysis, changing (decreasing or increasing) attribute-granularity levels is needed to seek desirable information. Reconstructing three-way concept lattices often requires huge computation and long elapsed time when attribute-granularity levels are changed. To avoid this problem, a good strategy is indirectly renewing three-way concept lattices. Our paper studies how to renew object-induced three-way concept lattices involving decreasing attribute-granularity levels. Firstly, we analyze changes of object-induced three-way concept lattices when attribute-granularity levels are decreased. To classify changes of object-induced three-way concepts, we classify these concepts into six categories, derive sufficient and necessary conditions of identifying these categories, and investigate their properties. To explore changes of covering relations among object-induced three-way concepts, we classify covering relations into three categories, and identify them by finding which are the destructors of deleted object-induced three-way concepts before the decrease, and analyzing which are children concepts of object-induced three-way concepts as destructors after the decrease. Secondly, by using the above analysis results, we put forward a novel algorithm called OEL-Collapse to renew object-induced three-way concept lattices when attribute-granularity levels are decreased. Finally, experiments are conducted to illustrate the efficiency of the OEL-Collapse algorithm.

Full Text
Paper version not known

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 call

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.