Cargando…
On the Depth of Decision Trees with Hypotheses
In this paper, based on the results of rough set theory, test theory, and exact learning, we investigate decision trees over infinite sets of binary attributes represented as infinite binary information systems. We define the notion of a problem over an information system and study three functions o...
Autor principal: | Moshkov, Mikhail |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8774416/ https://www.ncbi.nlm.nih.gov/pubmed/35052142 http://dx.doi.org/10.3390/e24010116 |
Ejemplares similares
-
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
por: Azad, Mohammad, et al.
Publicado: (2023) -
Decision Rules Derived from Optimal Decision Trees with Hypotheses
por: Azad, Mohammad, et al.
Publicado: (2021) -
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
por: Azad, Mohammad, et al.
Publicado: (2021) -
Decision Trees for Binary Subword-Closed Languages
por: Moshkov, Mikhail
Publicado: (2023) -
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
por: Ostonov, Azimkhon, et al.
Publicado: (2023)