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: | Chikalov, Igor (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| 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 |
Similar Items
-
Meta-Learning in Decision Tree Induction
by: Grąbczewski, Krzysztof
Published: (2014) -
Decision Making in Complex Systems The DeciMaS Agent-based Interdisciplinary Framework Approach /
by: Sokolova, Marina V., et al.
Published: (2012) -
Complex-Valued Neural Networks with Multi-Valued Neurons
by: Aizenberg, Igor
Published: (2011) -
A Practical Guide to Averaging Functions
by: Beliakov, Gleb, et al.
Published: (2016) -
Decision Making with Imperfect Decision Makers
Published: (2012)