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

Ostonov, Azimkhon; Moshkov, Mikhail

Ostonov, Azimkhon; Moshkov, Mikhail.

Afiliação

Ostonov A; Computer, Electrical and Mathematical Sciences & Engineering Division and Computational Bioscience Research Center, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia.
Moshkov M; Computer, Electrical and Mathematical Sciences & Engineering Division and Computational Bioscience Research Center, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia.

Entropy (Basel) ; 25(10)2023 Oct 03.

Article em En | MEDLINE | ID: mdl-37895532

Palavras-chave

closed classes of decision tables; deterministic decision trees; nondeterministic decision trees

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Idioma: En Revista: Entropy (Basel) Ano de publicação: 2023 Tipo de documento: Article País de afiliação: Arábia Saudita País de publicação: Suíça

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google