relation: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4549/
title: Solving reduction problems in cover lattice based decision tables
creator: Pham, Thanh Huyen
creator: Pham, Thi Ngan
creator: Ho, Thuan
creator: Vuong, Thi Hong
creator: Nguyen, Tri Thanh
creator: Ha, Quang Thuy
subject: Information Technology (IT)
subject: ISI/Scopus indexed conference
description: 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
type: Conference or Workshop Item
type: NonPeerReviewed
identifier:   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.