Cargando…
Average Time Complexity of Decision Trees
Decision tree is a widely used form of representing algorithms and knowledge. Compact data models and fast algorithms require optimization of tree complexity. This book is a research monograph on average time complexity of decision trees. It generalizes several known results and considers a number...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2011.
|
| Edición: | 1st ed. 2011. |
| Colección: | Intelligent Systems Reference Library,
21 |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 1 Introduction
- 2 Bounds on Average Time Complexity of Decision Trees
- 3 Representing Boolean Functions by Decision Trees
- 4 Algorithms for Decision Tree Construction
- 5 Problems Over Information Systems.