Welcome to Francis Academic Press

Academic Journal of Computing & Information Science, 2022, 5(14); doi: 10.25236/AJCIS.2022.051402.

Parallel incremental update of semi-monolayer covering rough set based on object set changes


Zhizhong Long, Chenggong Lv

Corresponding Author:
Zhizhong Long

College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo City, China


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.


semi-monolayer covering rough set; parallel computation; approximation rules; set value information System; grain calculation

Cite This Paper

Zhizhong Long, Chenggong Lv. Parallel incremental update of semi-monolayer covering rough set based on object set changes. Academic Journal of Computing & Information Science (2022), Vol. 5, Issue 14: 11-21. https://doi.org/10.25236/AJCIS.2022.051402.


[1] Zdzislaw Pawlak. Rough sets. International Journal of Computer and Information, 11:341–356, 1982.

[2] GAO Tianyu, WANG Qingrong, YANG Lei. Data Mining Model Based on Attribute Dependability Enhancement of Rough Set [J]. Computer Engineering and Applications, 2021, 57(3): 87-93.

[3] Yao Y. Three-way decision and granular computing [J]. International Journal of Approximate Reasoning, 2018, 103:107-123.

[4] Carlos Fernandez-Basso, M. Dolores Ruiz, and Maria J. Martin-Bautista. Spark solutions for discovering fuzzy association rules in big data. International Journal of Approximate Reasoning, 137:94–112, 2021.

[5] Chuan Luo, Tianrui Li, Hongmei Chen, and Lixia Lu. Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values.Information Sciences, 299:221–242, 2015.

[6] Jianfeng Xu, Duoqian Miao, Y uanjian Zhang, and Zhifei Zhang. A three-way decisions model with probabilistic rough sets for stream computing.International Journal of Approximate Reasoning, 88:1–22, 2017.

[7] Xiaojun Xie and Xiaolin Qin. A novel incremental attribute reduction approach for dynamic incomplete decision systems.International Journal of Approximate Reasoning, 93:443–462, 2018.

[8] Chengxiang Hu, Shixi Liu, and Xiaoling Huang. Dynamic updating approximations in multigranulation rough sets while refining or coarsening attribute values.Knowledge-Based Systems, 130:62–73, 2017. [9]

[9] Fanyu Bu, Zhikui Chen, Qingchen Zhang. A big data feature learning model supporting incremental updates [J]. Computer Engineering and Applications, 2015, 51(12):21-26.

[10] L. Dong and D. Chen. Incremental attribute reduction with rough set for dynamic datasets with simultaneously increasing samples and attributes.International Journal of Machine Learning and Cybernetics, 11(5), 2020.

[11] WU Yangyang, TANG Jianguo. Research Progress of Attribute Reduction Based on Rough Set in Context of Big Data[J]. Computer Engineering and Applications, 2019, 55(6): 31-38. 

[12] Junbo Zhang, Tian rui Li, and Hongmei Chen. Composite rough sets for dynamic data mining. Information Sciences, 257:81–100, 2014.

[13] WU Z J, CHEN N, GAO Y. Semi-monolayer cover rough set: Concept, property and granular algorithm .Information Sciences[J], 2018, 456: 97-112.

[14] WU Z J, WANG H, CHEN N, et al. Semi-monolayer covering rough set on set-valued information systems and its efficient computation[J]. International Journal of Approximate Reasoning, 2021, 130: 83-106.

[15] WU Zhengjiang, YANG Tian, ZHENG Ailing, MEI Qiuyu, ZHANG Yaning. Study on Set-Valued Data Balancing Method by Semi-Monolayer Covering Rough Set[J]. Computer Engineering and Applications, 2022, 58(19): 166-173.