Cargando…
Average time complexity of decision trees
This monograph generalizes several known results on the topic and considers a number of fresh problems. Combinatorics, probability theory and complexity theory are used in the proofs, as well as concepts from discrete mathematics and computer science.
Autores principales: | Chikalov, Igor, Jain, Lakhmi C |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2011
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2269156 |
Ejemplares similares
-
Extensions of dynamic programming for combinatorial optimization and data mining
por: AbouEisha, Hassan, et al.
Publicado: (2018) -
Decision and inhibitory trees and rules for decision tables with many-valued decisions
por: Alsolami, Fawaz, et al.
Publicado: (2019) -
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
por: Azad, Mohammad, et al.
Publicado: (2021) -
Decision Rules Derived from Optimal Decision Trees with Hypotheses
por: Azad, Mohammad, et al.
Publicado: (2021) -
Model averaging
por: Fletcher, David
Publicado: (2018)