Incremental approaches for updating reducts in dynamic covering information systems
作者:
Highlights:
•
摘要
In various real-world situations, there are actually a large number of dynamic covering information systems, and non-incremental learning technique is time consuming for updating approximations of sets in dynamic covering information systems. In this paper, we investigate incremental mechanisms of updating the second and sixth lower and upper approximations of sets in dynamic covering information systems with variations of attributes. Especially, we design effective algorithms for calculating the second and sixth lower and upper approximations of sets in dynamic covering information systems. The experimental results indicate that incremental algorithms outperform non-incremental algorithms in the presence of dynamic variation of attributes. Finally, we explore several examples to illustrate that the proposed approaches are feasible to perform knowledge reduction of dynamic covering information systems.
论文关键词:Characteristic matrix,Covering information system,Dynamic covering information system,Rough set
论文评审过程:Received 9 January 2017, Revised 16 June 2017, Accepted 19 July 2017, Available online 20 July 2017, Version of Record 13 September 2017.
论文官网地址:https://doi.org/10.1016/j.knosys.2017.07.020