TY  - CHAP
ID  - SisLab4482
UR  - https://link.springer.com/chapter/10.1007%2F978-981-16-1685-3_5
A1  - Pham, Thanh Huyen
A1  - Pham, Thi Ngan
A1  - Ho, Thuan
A1  - Vuong, Thi Hong
A1  - Nguyen, Tri Thanh
A1  - Ha, Quang Thuy
Y1  - 2021/04/07/
N2  - Covering based rough set is an important extension of Pawlak's traditional rough set. Reduction is a typical application of rough sets, including traditional, covering based and other rough set extensions. Although this task has several proposals, it is still an open problem to decision systems (tables) in covering based rough set. This paper focuses on the reduction problem for the condition lattice, and fitting problem for the decision lattice in the decision table based on cover lattice. A corresponding algorithm is proposed for each problem. Two examples to illustrate a covering based decision table and two related problems show the applications of these concepts and problems.
PB  - Springer
TI  - Solving Reduction Problems in Cover Lattice Based Decision Tables
SP  - 55
AV  - restricted
EP  - 64
T2  - ACIIDS 2021: Recent Challenges in Intelligent Information and Database Systems
ER  -