Average Time Complexity of Decision Trees

• Κύριος συγγραφέας: Chikalov, Igor (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011.
• Σειρά: Intelligent Systems Reference Library, 21
• Θέματα: Engineering.; Artificial intelligence.; Computational intelligence.; Computational Intelligence.; Artificial Intelligence (incl. Robotics).

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...

Πίνακας περιεχομένων:

• 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.