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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2018
|
| Sorozat: | Acta cybernetica
23 No. 4 |
| Kulcsszavak: | Számítástechnika, Programozás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.4.2018.4 |
| Online Access: | http://acta.bibl.u-szeged.hu/58180 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 1039-1054 |
| ISSN: | 0324-721X |