Abstract

Rough approximations play a significant role in rule extraction and decision making. However, re-scanning the entire data set to update the approximations is time-consuming due to the dynamic characteristics of objects in a neighborhood multigranulation space. In order to reduce the computational time, the neighborhood multigranulation approximations need to be updated in an incremental manner based on previously saved knowledge. Therefore, in this study, we establish a dynamic framework for maintaining the positive, boundary, and negative regions in neighborhood multigranulation spaces when adding or deleting objects from the matrix perspective. First, we explore the incremental mechanisms for updating relevant matrices when adding or deleting multiple objects. Based on the proposed mechanisms, we design the corresponding dynamic algorithms to incrementally update the positive, boundary, and negative regions. Finally, we conduct empirical experiments on benchmark UCI data sets to assess the feasibility and efficiency of our updating algorithms, which demonstrate their promising performance.

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.