Cargando…
Decision Rules Derived from Optimal Decision Trees with Hypotheses
Conventional decision trees use queries each of which is based on one attribute. In this study, we also examine decision trees that handle additional queries based on hypotheses. This kind of query is similar to the equivalence queries considered in exact learning. Earlier, we designed dynamic progr...
Autores principales: | Azad, Mohammad, Chikalov, Igor, Hussain, Shahid, Moshkov, Mikhail, Zielosko, Beata |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8700404/ https://www.ncbi.nlm.nih.gov/pubmed/34945947 http://dx.doi.org/10.3390/e23121641 |
Ejemplares similares
-
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
por: Azad, Mohammad, et al.
Publicado: (2021) -
Decision and inhibitory trees and rules for decision tables with many-valued decisions
por: Alsolami, Fawaz, et al.
Publicado: (2019) -
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
por: Azad, Mohammad, et al.
Publicado: (2023) -
On the Depth of Decision Trees with Hypotheses
por: Moshkov, Mikhail
Publicado: (2022) -
Partial covers, reducts and decision rules in rough sets: theory and applications
por: Piliszczuk, Marcin, et al.
Publicado: (2009)