Affiliations: [a] School of Computer and Information Engineering, Chuzhou University, Chuzhou, Anhui, China
| [b] School of Computer Science and Technology, Joint International Research Laboratory of Machine Learning and Neuromorphic Computing, Soochow University, Suzhou, Jiangsu, China
| [c] Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, Jiangsu, China
Correspondence:
[*]
Corresponding author. Li Zhang. E-mail: [email protected].
Abstract: Multigranulation rough set (MGRS) theory provides an effective manner for the problem solving by making use of multiple equivalence relations. As the information systems always dynamically change over time due to the addition or deletion of multiple objects, how to efficiently update the approximations in multigranulation spaces by making fully utilize the previous results becomes a crucial challenge. Incremental learning provides an efficient manner because of the incorporation of both the current information and previously obtained knowledge. In spite of the success of incremental learning, well-studied findings performed to update approximations in multigranulation spaces have relatively been scarce. To address this issue, in this paper, we propose matrix-based incremental approaches for updating approximations from the perspective of multigranulation when multiple objects vary over time. Based on the matrix characterization of multigranulation approximations, the incremental mechanisms for relevant matrices are systematically investigated while adding or deleting multiple objects. Subsequently, in accordance with the incremental mechanisms, the corresponding incremental algorithms for maintaining multigranulation approximations are developed to reduce the redundant computations. Finally, extensive experiments on eight datasets available from the University of California at Irvine (UCI) are conducted to verify the effectiveness and efficiency of the proposed incremental algorithms in comparison with the existing non-incremental algorithm.
