An Efficient Method to Reduce the Size of Consistent Decision Tables

Finding reductions from decision tables is one of the main objectives in information processing. Many studies focus on attribute reduct that reduces the number of columns in the decision table. The problem of finding all attribute reducts of consistent decision table is exponential in the number of...

Full description

Saved in:
Bibliographic Details
Published inActa cybernetica (Szeged) Vol. 23; no. 4; pp. 1039 - 1054
Main Authors Demetrovics, János, Quang, Hoang Minh, Thi, Vu Duc, Anh, Nguyen Viet
Format Journal Article
LanguageEnglish
Published Szeged Laszlo Nyul 01.01.2018
Subjects
Data processing
Decision theory
Polynomials
Online AccessGet full text

Cover

More Information
Summary:Finding reductions from decision tables is one of the main objectives in information processing. Many studies focus on attribute reduct that reduces the number of columns in the decision table. The problem of finding all attribute reducts of consistent decision table is exponential in the number of attributes. In this paper, we aim at finding solutions for the problem of decision table reduction in polynomial time. More specifically, we deal with both the object reduct problem and the attribute reduct problem in consistent decision tables. We proved theoretically that our proposed methods for the two problems run in polynomial time. The proposed methods can be combined to significantly reduce the size of a consistent decision table both horizontally and vertically.
ISSN:0324-721X
DOI:10.14232/actacyb.23.4.2018.4