%A Thanh Huyen Pham
%A Thi Ngan Pham
%A Thuan Ho
%A Thi Hong Vuong
%A Tri Thanh Nguyen
%A Quang Thuy Ha
%T Solving Reduction Problems in Cover Lattice Based Decision Tables
%X 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.
%P 55-64
%B ACIIDS 2021: Recent Challenges in Intelligent Information and Database Systems
%D 2021
%I Springer
%L SisLab4482