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...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edisyon: | 1st ed. 2011. |
| Seri Bilgileri: | Intelligent Systems Reference Library
21 |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Average Time Complexity of Decision Trees, Texte imprimé, 9783642226601 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642270161 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642226625 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642226601 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642270161 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642226625 • Average Time Complexity of Decision Trees, Texte imprimé, 9783642226601 |
İçindekiler:
- 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