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...
Main Author: | |
---|---|
Corporate Author: | |
Format: | Electronic eBook |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2011.
|
Series: | Intelligent Systems Reference Library,
21 |
Subjects: | |
Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.