eprintid: 4549
rev_number: 8
eprint_status: archive
userid: 286
dir: disk0/00/00/45/49
datestamp: 2021-06-28 02:04:56
lastmod: 2021-06-28 02:04:56
status_changed: 2021-06-28 02:04:56
type: conference_item
metadata_visibility: show
creators_name: Pham, Thanh Huyen
creators_name: Pham, Thi Ngan
creators_name: Ho, Thuan
creators_name: Vuong, Thi Hong
creators_name: Nguyen, Tri Thanh
creators_name: Ha, Quang Thuy
creators_id: phamthanhhuyen@daihochalong.edu.vn
creators_id: nganpt.di12@vnu.edu.vn
creators_id: hothuan@vast.ac.vn
creators_id: hongvt_57@vnu.edu.vn
creators_id: ntthanh@vnu.edu.vn
creators_id: thuyhq@vnu.edu.vn
title: Solving reduction problems in cover lattice based decision tables
ispublished: pub
subjects: IT
subjects: isi_scopus_conf
divisions: fac_fit
abstract: 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
full_text_status: none
pres_type: paper
event_title: ACIIDS 2021: Intelligent Information and Database Systems
event_type: conference
refereed: FALSE
citation:   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.