Abstract
The semi-monolayer covering rough set has the characteristics of high approximation quality and efficient computation. In the face of massive data changes, the study of rough sets will face the challenge of high complexity computation. To address the large-scale changes of object sets in set-valued decision information systems, this paper proposes a dynamic update method based on Spark framework to solve the approximation set problem of semi-monolayer covering rough set. This method is mainly embodied in four aspects: firstly, for the change of information grains in the proposed single-layer covering rough set, this paper proposes an update strategy for the change of information units; then for the update of reliable elements, an update strategy is proposed for 〖▁C_"GC0" 〗^' (X) and 〖¯C_"GC0" 〗^' (X); secondly, for the change of reliable elements and disputed elements, an RSM matrix update strategy; and finally the update strategy of the approximation set is proposed for the changes of information units. Since the incremental methods using other models will yield different approximation sets and the prerequisite of the comparison experiments requires the approximation sets to be consistent, in order to ensure the correctness of the experimental results, this paper designs the comparison experiments of static and dynamic algorithms based on the semi-monolayer covering rough set model. The experimental results with several data sets show that the incremental algorithm speeds up in 3.67~7.72 times than the static algorithm when there is an object set update.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have