Average Time Complexity of Decision Trees

  • Igor Chikalov

Part of the Intelligent Systems Reference Library book series (ISRL, volume 21)

Table of contents

  1. Front Matter
  2. Igor Chikalov
    Pages 1-14
  3. Igor Chikalov
    Pages 61-78
  4. Igor Chikalov
    Pages 79-84
  5. Back Matter

About this book

Introduction

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 of new problems. 

 

The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time 

complexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as 

well as concepts from various branches of discrete mathematics and computer science. The considered applications include

the study of average depth of decision trees for Boolean functions from closed classes, the comparison of results of the performance 

of greedy heuristics for average depth minimization with optimal decision trees constructed by dynamic programming algorithm,

and optimization of decision trees for the corner point recognition problem from computer vision.

 

The book can be interesting for researchers working on time complexity of algorithms and specialists 

in test theory, rough set theory, logical analysis of data and machine learning.

Keywords

Average Time Complexity Computational Intelligence Decision Trees Intelligent Systems

Authors and affiliations

  • Igor Chikalov
    • 1
  1. 1.Mathematical and Computer Sciences and Engineering Division4700 King Abdullah University of Science and TechnologyThuwalKingdom of Saudi Arabia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-22661-8
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Engineering
  • Print ISBN 978-3-642-22660-1
  • Online ISBN 978-3-642-22661-8
  • Series Print ISSN 1868-4394
  • Series Online ISSN 1868-4408
  • About this book