On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes

In this paper, we consider classes of conventional decision tables closed relative to the removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the minimum complexity of deterministic and nondeterministic decisi...

Descripción completa

Detalles Bibliográficos
Autores principales: Ostonov, Azimkhon, Moshkov, Mikhail
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606725/
https://www.ncbi.nlm.nih.gov/pubmed/37895532
http://dx.doi.org/10.3390/e25101411

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606725/
https://www.ncbi.nlm.nih.gov/pubmed/37895532
http://dx.doi.org/10.3390/e25101411

Ejemplares similares