Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916079791505408 |
|---|---|
| author | Ostonov, Azimkhon Moshkov, Mikhail |
| author_facet | Ostonov, Azimkhon Moshkov, Mikhail |
| contents | In this paper, we consider classes of decision tables closed under removal of attributes (columns) and changing of decisions attached to rows. For decision tables from closed classes, we study lower bounds on the minimum cardinality of reducts, which are minimal sets of attributes that allow us to recognize, for a given row, the decision attached to it. We assume that the number of rows in decision tables from the closed class is not bounded from above by a constant. We divide the set of such closed classes into two families. In one family, only standard lower bounds $Ω(\log $ ${\rm cl}(T))$ on the minimum cardinality of reducts for decision tables hold, where ${\rm cl}(T)$ is the number of decision classes in the table $T$. In another family, these bounds can be essentially tightened up to $Ω({\rm cl}(T)^{1/q})$ for some natural $q$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01324 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes Ostonov, Azimkhon Moshkov, Mikhail Computational Complexity In this paper, we consider classes of decision tables closed under removal of attributes (columns) and changing of decisions attached to rows. For decision tables from closed classes, we study lower bounds on the minimum cardinality of reducts, which are minimal sets of attributes that allow us to recognize, for a given row, the decision attached to it. We assume that the number of rows in decision tables from the closed class is not bounded from above by a constant. We divide the set of such closed classes into two families. In one family, only standard lower bounds $Ω(\log $ ${\rm cl}(T))$ on the minimum cardinality of reducts for decision tables hold, where ${\rm cl}(T)$ is the number of decision classes in the table $T$. In another family, these bounds can be essentially tightened up to $Ω({\rm cl}(T)^{1/q})$ for some natural $q$. |
| title | Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2401.01324 |