VNU-UET Repository

Solving Reduction Problems in Cover Lattice Based Decision Tables

Pham, Thanh Huyen and Pham, Thi Ngan and Ho, Thuan and Vuong, Thi Hong and Nguyen, Tri Thanh and Ha, Quang Thuy (2021) Solving Reduction Problems in Cover Lattice Based Decision Tables. In: ACIIDS 2021: Recent Challenges in Intelligent Information and Database Systems. Springer, pp. 55-64.

[img] HTML - Published Version
Restricted to Registered users only until 7 April 2025.

Download (82kB)


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.

Item Type: Book Section
Subjects: ISI/Scopus indexed conference
Divisions: Faculty of Information Technology (FIT)
Depositing User: Hà Quang Thụy
Date Deposited: 18 Jun 2021 11:13
Last Modified: 18 Jun 2021 11:13

Actions (login required)

View Item View Item