%A ZHAO Yi-lin, JIANG Lin, MI Yun-long, LI Jin-hai %T Dynamic Parallel Updating Algorithm for Approximate Sets of Graded Multi-granulation Rough Set Based on Weighting Granulations and Dominance Relation %0 Journal Article %D 2018 %J Computer Science %R 10.11896/j.issn.1002-137X.2018.10.003 %P 11-20 %V 45 %N 10 %U {https://www.jsjkx.com/CN/abstract/article_461.shtml} %8 2018-11-05 %X With the continuous updating of large data sets,the classical multi-granulation rough set theory is no longer practical.Therefore,this paper put forward the related theory of graded pessimistic multi-granulation rough set with weighting granulations and dominance relation,graded optimistic multi-granulation rough set with weighting granulations and dominance relation.On the basis of this improved theory,this paper proposed a dynamic parallel updating algorithm forapproximate sets of graded multi-granulation rough set based on weighting granulations and dominance relation.Finally,the experiment verifies the effectiveness of the proposed algorithm,which is able to handle data with massive dynamic updates and improve running efficiency.