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 Solving reduction problems in cover lattice based decision tables. In: ACIIDS 2021: Intelligent Information and Database Systems.

Full text not available from this repository.


Covering based rough set is an important extension of Paw-lak's traditional rough set. Reduction is a typical application of rough sets, including traditional, cover-ing based and other rough set extensions. Although this task has several pro-posals, 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 lat-tice. A corresponding algorithm is proposed for each problem. Two examples to illustrate a covering based decision table and two related problems show the ap-plications of these concepts and problems

Item Type: Conference or Workshop Item (Paper)
Subjects: Information Technology (IT)
ISI/Scopus indexed conference
Divisions: Faculty of Information Technology (FIT)
Depositing User: Ass. Prof. Tri-Thanh NGUYEN
Date Deposited: 28 Jun 2021 02:04
Last Modified: 28 Jun 2021 02:04

Actions (login required)

View Item View Item