Abstract

Core is an important concept of rough set theory and many efficient reduction methods were proposed from the computation of core. However, very little work has been performed on updating a core, especially for incomplete decision tables. In this paper an incremental algorithm for updating the core of an incomplete decision table is presented based on discernibility matrix, which may obtain a new core through several simple operations on original discernibility matrix when a new object is added to the decision table. Theoretical analysis and example show that the incremental core algorithm proposed is efficient for incomplete decision tables.

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.